Sciweavers

6365 search results - page 894 / 1273
» Fast Local Computation Algorithms
Sort
View
VC
2010
160views more  VC 2010»
15 years 5 months ago
A lightweight approach to repairing digitized polygon meshes
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
Marco Attene
ICCV
1998
IEEE
16 years 8 months ago
View-Based Object Matching
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
Ali Shokoufandeh, Ivan Marsic, Sven J. Dickinson
MOBIHOC
2005
ACM
16 years 6 months ago
Timed grid routing (TIGR) bites off energy
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...
Roy Friedman, Guy Korland
IPSN
2009
Springer
16 years 1 months ago
Predictive QoS routing to mobile sinks in wireless sensor networks
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
Branislav Kusy, HyungJune Lee, Martin Wicke, Nikol...
ICPP
2000
IEEE
15 years 10 months ago
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
Adriana Iamnitchi, Ian T. Foster