Sciweavers

1950 search results - page 271 / 390
» Varieties of Increasing Trees
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 26 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CVPR
2008
IEEE
15 years 2 days ago
Semantic texton forests for image categorization and segmentation
We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not ne...
Jamie Shotton, Matthew Johnson, Roberto Cipolla
ECCV
2006
Springer
14 years 12 months ago
Learning to Detect Objects of Many Classes Using Binary Classifiers
Viola and Jones [VJ] demonstrate that cascade classification methods can successfully detect objects belonging to a single class, such as faces. Detecting and identifying objects t...
Ramana Isukapalli, Ahmed M. Elgammal, Russell Grei...
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 11 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...