Sciweavers

613 search results - page 70 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
129
Voted
VLDB
2001
ACM
138views Database» more  VLDB 2001»
15 years 8 months ago
A Data Warehousing Architecture for Enabling Service Provisioning Process
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
Yannis Kotidis
153
Voted
ICDE
2010
IEEE
562views Database» more  ICDE 2010»
16 years 3 months ago
Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...
140
Voted
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 4 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
133
Voted
ICFP
2010
ACM
15 years 4 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...
213
Voted
VLDB
2008
ACM
103views Database» more  VLDB 2008»
16 years 3 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...