Sciweavers

2136 search results - page 191 / 428
» Improving on Expectation Propagation
Sort
View
FPL
2009
Springer
103views Hardware» more  FPL 2009»
14 years 8 months ago
Customizable domain-specific computing
In this article, we introduce the ongoing research in modeling and mapping for heterogeneous, customizable, parallel systems, as part of the effort in the newly established Center...
Jason Cong
JMLR
2011
105views more  JMLR 2011»
14 years 6 months ago
Posterior Sparsity in Unsupervised Dependency Parsing
A strong inductive bias is essential in unsupervised grammar induction. In this paper, we explore a particular sparsity bias in dependency grammars that encourages a small number ...
Jennifer Gillenwater, Kuzman Ganchev, João ...
CVPR
2012
IEEE
13 years 1 months ago
Active image clustering: Seeking constraints from humans to complement algorithms
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
Arijit Biswas, David W. Jacobs
88
Voted
MOBICOM
2003
ACM
15 years 4 months ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...
FOCS
2010
IEEE
14 years 9 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan