Sciweavers

423 search results - page 74 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
DL
2000
Springer
162views Digital Library» more  DL 2000»
14 years 1 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
14 years 9 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
MIR
2004
ACM
176views Multimedia» more  MIR 2004»
14 years 2 months ago
Analysing the performance of visual, concept and text features in content-based video retrieval
This paper describes revised content-based search experiments in the context of TRECVID 2003 benchmark. Experiments focus on measuring content-based video retrieval performance wi...
Mika Rautiainen, Timo Ojala, Tapio Seppänen
IS
2007
13 years 8 months ago
Schema-conscious XML indexing
User queries on extensible markup language (XML) documents are typically expressed as regular path expressions. A variety of indexing techniques for efficiently retrieving the re...
Krishna P. Leela, Jayant R. Haritsa
WWW
2007
ACM
14 years 9 months ago
Detecting near-duplicates for web crawling
Near-duplicate web documents are abundant. Two such documents differ from each other in a very small portion that displays advertisements, for example. Such differences are irrele...
Gurmeet Singh Manku, Arvind Jain, Anish Das Sarma