Sciweavers

4926 search results - page 641 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
TASE
2010
IEEE
13 years 3 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
CGF
2008
135views more  CGF 2008»
13 years 8 months ago
Streaming Surface Reconstruction Using Wavelets
We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution rep...
Josiah Manson, G. Petrova, Scott Schaefer
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 3 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini