Sciweavers

541 search results - page 88 / 109
» Query Strategies for Priced Information
Sort
View
ICAI
2004
13 years 10 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
CORR
2008
Springer
173views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
Fangwen Fu, Mihaela van der Schaar
CIKM
2003
Springer
14 years 1 months ago
Question answering from the web using knowledge annotation and knowledge mining techniques
We present a strategy for answering fact-based natural language questions that is guided by a characterization of realworld user queries. Our approach, implemented in a system cal...
Jimmy J. Lin, Boris Katz
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 10 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 8 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...