Sciweavers

1887 search results - page 354 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
MMDB
2003
ACM
178views Multimedia» more  MMDB 2003»
14 years 28 days ago
Video query processing in the VDBMS testbed for video database research
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...
Walid G. Aref, Moustafa A. Hammad, Ann Christine C...
MMDB
2004
ACM
148views Multimedia» more  MMDB 2004»
14 years 1 months ago
A unified framework for image database clustering and content-based retrieval
With the proliferation of image data, the need to search and retrieve images efficiently and accurately from a large image database or a collection of image databases has drastica...
Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui ...
ICIP
2010
IEEE
13 years 5 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham