Sciweavers

339 search results - page 47 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
IPSN
2003
Springer
14 years 1 months ago
A Collaborative Approach to In-Place Sensor Calibration
Abstract. Numerous factors contribute to errors in sensor measurements. In order to be useful, any sensor device must be calibrated to adjust its accuracy against the expected meas...
Vladimir Bychkovskiy, Seapahn Megerian, Deborah Es...
NOMS
2008
IEEE
14 years 3 months ago
Host-aware routing in multicast overlay backbone
— To support large-scale Internet-based broadcast of live streaming video efficiently in content delivery networks (CDNs), it is essential to implement a cost-effective overlay ...
Jun Guo, Sanjay Jha
INFOCOM
2006
IEEE
14 years 2 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
12 years 11 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy