Sciweavers

2925 search results - page 534 / 585
» Information Complexity of Online Problems
Sort
View
PODC
2006
ACM
14 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
GROUP
2005
ACM
14 years 3 months ago
An optimization approach to group coupling in heterogeneous collaborative systems
Recent proliferation of computing devices has brought attention to heterogeneous collaborative systems, where key challenges arise from the resource limitations and disparities. S...
Carlos D. Correa, Ivan Marsic
IPSN
2005
Springer
14 years 3 months ago
Lazy inference on object identities in wireless sensor networks
Tracking the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic difficulty of ...
Jaewon Shin, Nelson Lee, Sebastian Thrun, Leonidas...
W2GIS
2004
Springer
14 years 3 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
ITC
2003
IEEE
148views Hardware» more  ITC 2003»
14 years 3 months ago
HyAC: A Hybrid Structural SAT Based ATPG for Crosstalk
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
Xiaoliang Bai, Sujit Dey, Angela Krstic