Sciweavers

782 search results - page 110 / 157
» Can a Parser be Generated from Examples
Sort
View
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 5 months ago
Efficient Query Subscription Processing in a Multicast Environment
Abstract Arturo Crespo, Orkut Buyukkokten, and Hector Garcia-Molina Stanford University With information dissemination (information push), data is delivered from a set of producers...
Arturo Crespo, Orkut Buyukkokten, Hector Garcia-Mo...
ICRA
2008
IEEE
136views Robotics» more  ICRA 2008»
15 years 10 months ago
Modeling multi-robot interaction using generalized occupancy grids, with application to reducing spatial interference
— As part of a program to find methods of reducing spatial interference in multi-robot systems, we propose the Interaction Grid (IG), a generalization of the Occupancy Grid that...
Mauricio Zuluaga, Richard T. Vaughan
PLDI
2000
ACM
15 years 8 months ago
Dynamo: a transparent dynamic optimization system
We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stre...
Vasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia
NLP
2000
15 years 7 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
CIKM
2008
Springer
15 years 5 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...