Sciweavers

430 search results - page 27 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
CGF
2004
165views more  CGF 2004»
14 years 10 months ago
Point Cloud Collision Detection
In the past few years, many efficient rendering and surface reconstruction algorithms for point clouds have been developed. However, collision detection of point clouds has not be...
Jan Klein, Gabriel Zachmann
81
Voted
JAIR
1998
92views more  JAIR 1998»
14 years 10 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
99
Voted
EDBT
2009
ACM
106views Database» more  EDBT 2009»
15 years 2 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
PRESENCE
1998
123views more  PRESENCE 1998»
14 years 10 months ago
A Real-Time Algorithm for Accurate Collision Detection for Deformable Polyhedral Objects
We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objec...
Yoshifumi Kitamura, Andrew Smith, Haruo Takemura, ...
IPL
1998
119views more  IPL 1998»
14 years 10 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh