800 search results - page 74 / 160 » Local Fisher Embedding |
SIAMCOMP
2008
13 years 10 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
EMNETS
2007
14 years 2 months ago
2007
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
ECCV
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structure...
SENSYS
2009
ACM
14 years 4 months ago
2009
ACM
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
SENSYS
2006
ACM
14 years 4 months ago
2006
ACM
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...