Sciweavers

4744 search results - page 263 / 949
» Connected Computing
Sort
View
MOBIHOC
2007
ACM
16 years 3 months ago
Surviving attacks on disruption-tolerant networks without authentication
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
John Burgess, George Dean Bissias, Mark D. Corner,...
132
Voted
MOBISYS
2007
ACM
16 years 3 months ago
Vehicular opportunistic communication under the microscope
We consider the problem of providing vehicular Internet access using roadside 802.11 access points. We build on previous work in this area [18, 8, 5, 11] with an extensive experim...
David Hadaller, Srinivasan Keshav, Tim Brecht, Shu...
CVPR
1997
IEEE
16 years 6 months ago
Disparity Component Matching for Visual Correspondence
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
Yuri Boykov, Olga Veksler, Ramin Zabih
IPSN
2007
Springer
15 years 10 months ago
Wireless localization using self-organizing maps
Localization is an essential service for many wireless sensor network applications. While several localization schemes rely on anchor nodes and range measurements to achieve fine...
Gianni Giorgetti, Sandeep K. S. Gupta, Gianfranco ...
SGP
2003
15 years 5 months ago
Explicit Surface Remeshing
We present a new remeshing scheme based on the idea of improving mesh quality by a series of local modifications of the mesh geometry and connectivity. Our contribution to the fa...
Vitaly Surazhsky, Craig Gotsman