Sciweavers

234 search results - page 33 / 47
» On the relative complexity of approximate counting problems
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
FCS
2007
13 years 9 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 4 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
PODS
2010
ACM
197views Database» more  PODS 2010»
13 years 7 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link