Sciweavers

1026 search results - page 130 / 206
» On Finding Minimal w-cutset
Sort
View
PERCOM
2007
ACM
14 years 9 months ago
Context Aware Routing of Enterprise User Communications
This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locatio...
Munmun De Choudhury, Hari Sundaram, Ajita John, Do...
MOBISYS
2008
ACM
14 years 9 months ago
Peopletones: a system for the detection and notification of buddy proximity on mobile phones
Mobile phones have the potential to be useful agents for their owners by detecting and reporting situations that are of interest. Several challenges emerge in the case of detectin...
Kevin A. Li, Timothy Sohn, Steven Huang, William G...
MOBISYS
2007
ACM
14 years 9 months ago
Triage: balancing energy and quality of service in a microserver
The ease of deployment of battery-powered and mobile systems is pushing the network edge far from powered infrastructures. A primary challenge in building untethered systems is of...
Nilanjan Banerjee, Jacob Sorber, Mark D. Corner, S...
MOBIHOC
2003
ACM
14 years 9 months ago
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
Venugopalan Ramasubramanian, Zygmunt J. Haas, Emin...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 7 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon