Sciweavers

1941 search results - page 296 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...
ASPLOS
2009
ACM
16 years 6 months ago
Mixed-mode multicore reliability
Future processors are expected to observe increasing rates of hardware faults. Using Dual-Modular Redundancy (DMR), two cores of a multicore can be loosely coupled to redundantly ...
Philip M. Wells, Koushik Chakraborty, Gurindar S. ...
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
16 years 6 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 6 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 6 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang