2907 search results - page 198 / 582 » Presentations of Structures in Admissible Sets |
190
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
172
click to vote
CP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
178
click to vote
IJRR
2002
15 years 6 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
196
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
208
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
Work in progress towards modeling shape statistics of multiobject complexes is presented. Constraints defined by the set of objects such as a compact representation of object shap...