Sciweavers

565 search results - page 105 / 113
» Geometry of Upper Probabilities
Sort
View
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
MOBIHOC
2009
ACM
14 years 10 months ago
Secure multidimensional range queries in sensor networks
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
Rui Zhang, Jing Shi, Yanchao Zhang
MOBISYS
2007
ACM
14 years 9 months ago
Context-for-wireless: context-sensitive energy-efficient wireless data transfer
Ubiquitous connectivity on mobile devices will enable numerous new applications in healthcare and multimedia. We set out to check how close we are towards ubiquitous connectivity ...
Ahmad Rahmati, Lin Zhong
CLUSTER
2009
IEEE
14 years 4 months ago
Utility analysis for Internet-oriented server consolidation in VM-based data centers
—Server consolidation based on virtualization technology will simplify system administration, reduce the cost of power and physical infrastructure, and improve utilization in tod...
Ying Song, Yanwei Zhang, Yuzhong Sun, Weisong Shi
GLOBECOM
2009
IEEE
14 years 4 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...