Sciweavers

2070 search results - page 104 / 414
» Regret-Minimizing Representative Databases
Sort
View
115
Voted
ICDE
1998
IEEE
139views Database» more  ICDE 1998»
15 years 6 months ago
Cost and Imprecision in Modeling the Position of Moving Objects
Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chica...
Ouri Wolfson, Sam Chamberlain, Son Dao, Liqin Jian...
112
Voted
RIDE
1997
IEEE
15 years 6 months ago
Evaluation of Sampling for Data Mining of Association Rules
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
141
Voted
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 6 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
125
Voted
BIS
2008
114views Business» more  BIS 2008»
15 years 4 months ago
Determining Relevant Deep Web Sites by Query Context Identification
Deep web search requires a transformation between search keywords and semantically described and well-formed data structures. We approached this problem in our "In the Web of ...
Zsolt Tivadar Kardkovács, Domonkos Tikk
98
Voted
NAR
2007
75views more  NAR 2007»
15 years 2 months ago
ApiDB: integrated resources for the apicomplexan bioinformatics resource center
ApiDB (http://ApiDB.org) represents a unified entry point for the NIH-funded Apicomplexan Bioinformatics Resource Center (BRC) that integrates numerous database resources and mult...
Cristina Aurrecoechea, Mark Heiges, Haiming Wang, ...