Sciweavers

1175 search results - page 202 / 235
» Querying by examples
Sort
View
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 7 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
TCSV
2002
134views more  TCSV 2002»
13 years 7 months ago
Factor graph framework for semantic video indexing
Video query by semantic keywords is one of the most challenging research issues in video data management. To go beyond low-level similarity and access video data content by semanti...
Milind R. Naphade, Igor Kozintsev, Thomas S. Huang
PVLDB
2008
74views more  PVLDB 2008»
13 years 7 months ago
Out-of-order processing: a new architecture for high-performance stream systems
Many stream-processing systems enforce an order on data streams during query evaluation to help unblock blocking operators and purge state from stateful operators. Such in-order p...
Jin Li, Kristin Tufte, Vladislav Shkapenyuk, Vassi...
SPIN
2010
Springer
13 years 6 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
ECCC
2010
83views more  ECCC 2010»
13 years 5 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...