Sciweavers

2064 search results - page 273 / 413
» Segmentation Problems
Sort
View
103
Voted
SENSYS
2004
ACM
15 years 6 months ago
MNP: multihop network reprogramming service for sensor networks
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogram...
Limin Wang
ICCVW
1999
Springer
15 years 5 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
ENDM
2008
142views more  ENDM 2008»
15 years 27 days ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 17 days ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
IJSNET
2007
98views more  IJSNET 2007»
15 years 22 days ago
Supporting mobile device communications in the presence of broadcast servers
Abstract: Broadcast data dissemination is well-suited for mobile wireless environments, where bandwidth is scarce, and mutual interference must be minimized. However, broadcasting ...
Anup Mayank, Chinya V. Ravishankar