Sciweavers

1887 search results - page 225 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
SMA
2008
ACM
203views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Interactive continuous collision detection between deformable models using connectivity-based culling
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manoc...
CSR
2007
Springer
14 years 3 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
13 years 7 months ago
Multi-label Feature Selection for Graph Classification
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
Xiangnan Kong, Philip S. Yu
DSS
2008
186views more  DSS 2008»
13 years 9 months ago
A machine learning approach to web page filtering using content and structure analysis
As the Web continues to grow, it has become increasingly difficult to search for relevant information using traditional search engines. Topic-specific search engines provide an al...
Michael Chau, Hsinchun Chen
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 9 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...