Sciweavers

505 search results - page 98 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
PODC
2009
ACM
14 years 9 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
MOBISYS
2008
ACM
14 years 8 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...
IPSN
2005
Springer
14 years 1 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
COMPSAC
1998
IEEE
14 years 21 days ago
Allocating Data Objects to Multiple Sites for Fast Browsing of Hypermedia Documents
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
CASES
2008
ACM
13 years 10 months ago
StageNetSlice: a reconfigurable microarchitecture building block for resilient CMP systems
Although CMOS feature size scaling has been the source of dramatic performance gains, it has lead to mounting reliability concerns due to increasing power densities and on-chip te...
Shantanu Gupta, Shuguang Feng, Amin Ansari, Jason ...