Sciweavers

7351 search results - page 1078 / 1471
» Segmenting Point Sets
Sort
View
ICPP
2009
IEEE
16 years 1 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
SIBGRAPI
2008
IEEE
16 years 1 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ICCV
2007
IEEE
16 years 1 months ago
Motion Analysis of Endovascular Stent-Grafts by MDL Based Registration
The endovascular repair of a traumatic rupture of the thoracic aorta - that would otherwise lead to the death of the patient - is performed by delivering a stent-graft into the ve...
Georg Langs, Nikos Paragios, Rene Donner, Pascal D...
HPCC
2007
Springer
16 years 1 months ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham
STACS
2007
Springer
16 years 28 days ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
« Prev « First page 1078 / 1471 Last » Next »