Sciweavers

4137 search results - page 254 / 828
» On the number of matchings of a tree
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 7 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
CVPR
2010
IEEE
16 years 3 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 11 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 10 months ago
Oracle8i Index-Organized Table and Its Application to New Domains
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
Jagannathan Srinivasan, Souripriya Das, Chuck Frei...
193
Voted
CVPR
2003
IEEE
16 years 8 months ago
Spacetime Stereo: Shape Recovery for Dynamic Scenes
This paper extends the traditional binocular stereo problem into the spacetime domain, in which a pair of video streams is matched simultaneously instead of matching pairs of imag...
Li Zhang, Brian Curless, Steven M. Seitz