2899 search results - page 276 / 580 » Dynamic Trees in Practice |
124
click to vote
IJCAI
1997
15 years 5 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
130
click to vote
WSCG
2000
15 years 5 months ago
2000
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
169
click to vote
COMGEO
2000
ACM
15 years 4 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
129
click to vote
TOMS
2010
15 years 2 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
140
click to vote
COLING
2010
14 years 11 months ago
2010
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...