Sciweavers

2095 search results - page 287 / 419
» Improved pebbling bounds
Sort
View
DAM
2007
177views more  DAM 2007»
13 years 10 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
TMC
2010
210views more  TMC 2010»
13 years 8 months ago
Exploiting Reactive Mobility for Collaborative Target Detection in Wireless Sensor Networks
—Recent years have witnessed the deployments of wireless sensor networks in a class of mission-critical applications such as object detection and tracking. These applications oft...
Rui Tan, Guoliang Xing, Jianping Wang, Hing-Cheung...
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 5 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
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