Sciweavers

3212 search results - page 208 / 643
» Faster Concept Analysis
Sort
View
EDBT
2009
ACM
136views Database» more  EDBT 2009»
15 years 11 months ago
Finding frequent co-occurring terms in relational keyword search
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
Yufei Tao, Jeffrey Xu Yu
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 11 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
ACISICIS
2007
IEEE
15 years 11 months ago
A Framework to Detect Deviations During Process Enactment
People enacting processes deviate from the process definition for a variety of different reasons, the consequences of which may be either positive or negative. Detecting deviation...
Sean Thompson, Torab Torabi, Purva Joshi
CVPR
2006
IEEE
15 years 11 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
92
Voted
ICTAI
2006
IEEE
15 years 11 months ago
Efficient Search Using Bitboard Models
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
Pablo San Segundo, Ramón Galán, Fern...