Sciweavers

820 search results - page 92 / 164
» Finding low-utility data structures
Sort
View
CVPR
2003
IEEE
14 years 11 months ago
A 2D Moving Grid Geometric Deformable Model
Geometric deformable models based on the level set method have become very popular in the last several years. To overcome an inherent limitation in accuracy while maintaining comp...
Xiao Han, Chenyang Xu, Jerry L. Prince
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
14 years 9 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
ICALP
1992
Springer
14 years 28 days ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
CIKM
2008
Springer
13 years 10 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
13 years 10 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...