Sciweavers

213 search results - page 32 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
ICDT
2010
ACM
219views Database» more  ICDT 2010»
15 years 9 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...
CIKM
2009
Springer
15 years 6 months ago
Post-rank reordering: resolving preference misalignments between search engines and end users
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
Chao Liu, Mei Li, Yi-Min Wang
ICPR
2010
IEEE
15 years 5 months ago
Motif Discovery and Feature Selection for CRF-Based Activity Recognition
Abstract—Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular ...
Liyue Zhao, Xi Wang, Gita Sukthankar
EOR
2008
78views more  EOR 2008»
14 years 12 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas