Sciweavers

611 search results - page 118 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
ACL
2012
11 years 9 months ago
Towards the Unsupervised Acquisition of Discourse Relations
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
Christian Chiarcos
WWW
2009
ACM
14 years 7 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
PODC
2005
ACM
14 years 18 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
INFORMS
2010
138views more  INFORMS 2010»
13 years 5 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 1 months ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl