Sciweavers

1887 search results - page 48 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 5 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
ROMAN
2007
IEEE
181views Robotics» more  ROMAN 2007»
14 years 2 months ago
Efficient Articulated Model Fitting on a Single Image or a Sequence
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
Matheen Siddiqui, Gérard G. Medioni
FGCS
2000
81views more  FGCS 2000»
13 years 7 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
ICTAI
2002
IEEE
14 years 20 days ago
Data Mining Using Cultural Algorithms and Regional Schemata
In the paper we demonstrate how evolutionary search for functional optima can be used as a vehicle for data mining. That is, in the process of searching for optima in a multi-dime...
Xidong Jin, Robert G. Reynolds
TKDE
2008
136views more  TKDE 2008»
13 years 7 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng