Sciweavers

2593 search results - page 101 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
EDBT
2006
ACM
159views Database» more  EDBT 2006»
16 years 5 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
AFRIGRAPH
2010
ACM
15 years 10 months ago
Adaptive LOD editing of quad meshes
We present a method for editing the LOD of quad meshes, which supports both adaptive refinement and adaptive coarsening. Starting at a base mesh, we generate a quad-dominant mesh...
Daniele Panozzo, Enrico Puppo
ICML
2008
IEEE
16 years 5 months ago
Fully distributed EM for very large datasets
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
Jason Wolfe, Aria Haghighi, Dan Klein
166
Voted
CAD
2005
Springer
15 years 4 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau
EDCC
2005
Springer
15 years 10 months ago
Efficient Single-Pattern Fault Simulation on Structurally Synthesized BDDs
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
Jaan Raik, Raimund Ubar, Sergei Devadze, Artur Jut...