Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2015
Contour-based Trilateration for Indoor Fingerprinting Localization
SenSys '15: Proceedings of the 13th ACM Conference on Embedded Networked Sensor SystemsPages 225–238https://doi.org/10.1145/2809695.2809703Trilateration has been widely and successfully employed to locate outdoor mobile devices due to its accuracy. However, it cannot be directly applied for indoor localization due to issues such as non-line-of-sight measurement and multipath fading. Though ...
- research-articleApril 2012
Anónimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 24, Issue 4Pages 590–604https://doi.org/10.1109/TKDE.2010.267The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Anonymization of these social graphs is important to facilitate publishing these data sets for analysis by external entities. ...
- research-articleSeptember 2011
Human Pose Estimation Using Consistent Max Covering
IEEE Transactions on Pattern Analysis and Machine Intelligence (ITPM), Volume 33, Issue 9Pages 1911–1918https://doi.org/10.1109/TPAMI.2011.92A novel consistent max-covering method is proposed for human pose estimation. We focus on problems in which a rough foreground estimation is available. Pose estimation is formulated as a jigsaw puzzle problem in which the body part tiles maximally cover ...
- research-articleSeptember 2011
Multiple Object Tracking Using K-Shortest Paths Optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence (ITPM), Volume 33, Issue 9Pages 1806–1819https://doi.org/10.1109/TPAMI.2011.21Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in ...
- research-articleJune 2010
Motion Estimation for Nonoverlapping Multicamera Rigs: Linear Algebraic and {\rm L}_\infty Geometric Solutions
IEEE Transactions on Pattern Analysis and Machine Intelligence (ITPM), Volume 32, Issue 6Pages 1044–1059https://doi.org/10.1109/TPAMI.2009.82We investigate the problem of estimating the ego-motion of a multicamera rig from two positions of the rig. We describe and compare two new algorithms for finding the 6 degrees of freedom (3 for rotation and 3 for translation) of the motion. One ...
- research-articleOctober 2009
Large Margin Feature Weighting Method via Linear Programming
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 21, Issue 10Pages 1475–1488https://doi.org/10.1109/TKDE.2008.238The problem of feature selection is a difficult combinatorial task in machine learning and of high practical relevance. In this paper, we consider feature selection method for multimodally distributed data, and present a large margin feature weighting ...
- research-articleMay 2008
A linear programming formulation for security-aware gate sizing
GLSVLSI '08: Proceedings of the 18th ACM Great Lakes symposium on VLSIPages 273–278https://doi.org/10.1145/1366110.1366176Differential power analysis (DPA) has been shown to be the dominant type of side-channel attacks that significantly jeopardize the security in integrated circuits. It has been shown that the data, the functional unit operations as well as the internal ...
- articleMarch 2007
The stochastic time–cost tradeoff problem: A robust optimization approach
Networks (NWKS), Volume 49, Issue 2Pages 175–188We consider the problem of allocating resources to projects performed under given due dates and stochastic time–cost tradeoff settings. In particular, we show how to implement a state-of-the-art methodology known as “robust optimization” to solve the ...
- research-articleJanuary 2007
Optimal Joint Session Admission Control in Integrated WLAN and CDMA Cellular Networks with Vertical Handoff
This paper considers optimizing the utilization of radio resources in a heterogeneous integrated system consisting of two different networks: a wireless local area network (WLAN) and a wideband code division multiple access (CDMA) network. We propose a ...
- research-articleAugust 2006
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers (ITCO), Volume 55, Issue 8Pages 985–999https://doi.org/10.1109/TC.2006.128We consider scheduling problems in the master-slave model. In this model, each job has to be processed sequentially in three stages. In the first stage, a preprocessing task runs on a master machine, in the second stage, a slave task runs on a dedicated ...
- research-articleJune 2006
Comment on "Computing the Shortest Network under a Fixed Topology'
IEEE Transactions on Computers (ITCO), Volume 55, Issue 6Pages 783–784https://doi.org/10.1109/TC.2006.84In a recent paper [2], a linear programming formulation was given for the problem of computing a shortest network under a fixed topology (under the \lambda{\hbox{-}}{\rm metric}). We point out a nontrivial error in this paper and give a correct and ...
- research-articleMay 2006
Reliable Packet Transmissions in Multipath Routed Wireless Networks
IEEE Transactions on Mobile Computing (ITMV), Volume 5, Issue 5Pages 548–559https://doi.org/10.1109/TMC.2006.72We study the problem of using path diversification to provide low probability of packet loss (PPL) in wireless networks. Path diversification uses erasure codes and multiple paths in the network to transmit packets. The source uses Forward Error ...
- research-articleSeptember 2002
Computing the Shortest Network under a Fixed Topology
IEEE Transactions on Computers (ITCO), Volume 51, Issue 9Pages 1117–1120https://doi.org/10.1109/TC.2002.1032631We show that, in any given uniform orientation metric plane, the shortest network interconnecting a given set of points under a fixed topology can be computed by solving a linear programming problem whose size is bounded by a polynomial in the number of ...
- research-articleDecember 2000
Designing Process Replication and Activation: A Quantitative Approach
IEEE Transactions on Software Engineering (ISOF), Volume 26, Issue 12Pages 1168–1178https://doi.org/10.1109/32.888630Distributed application systems are composed of classes of objects with instances that interact to accomplish common goals. Such systems can have many classes of users with many types of requests. Furthermore, the relative load of these classes can ...
- research-articleNovember 1998
Performance Analysis of Stochastic Timed Petri Nets Using Linear Programming Approach
IEEE Transactions on Software Engineering (ISOF), Volume 24, Issue 11Pages 1014–1030https://doi.org/10.1109/32.730548Stochastic timed Petri nets are a useful tool in performance analysis of concurrent systems such as parallel computers, communication networks, and flexible manufacturing systems. In general, performance measures of stochastic timed Petri nets are ...
- research-articleSeptember 1988
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports
IEEE Transactions on Computers (ITCO), Volume 37, Issue 9Pages 1148–1151https://doi.org/10.1109/12.2270The problem of minimizing the number of service ports of a central facility which serves a number of users subject to some constraints is addressed. At any time, a set of at most s users may want to use the facility, and one user can be connected to ...