Sciweavers

2440 search results - page 440 / 488
» Data-Intensive Question Answering
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 9 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 8 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
MOBISYS
2004
ACM
14 years 8 months ago
Tracking Moving Devices with the Cricket Location System
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infra...
Adam Smith, Hari Balakrishnan, Michel Goraczko, Ni...
WSDM
2010
ACM
265views Data Mining» more  WSDM 2010»
14 years 6 months ago
Data-oriented Content Query System: Searching for Data into Text on the Web
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
Kevin Chen-Chuan Chang, Mianwei Zhou, Tao Cheng
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 6 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang