Sciweavers

1059 search results - page 77 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
WWW
2004
ACM
15 years 10 months ago
Newsjunkie: providing personalized newsfeeds via analysis of information novelty
We present a principled methodology for filtering news stories by formal measures of information novelty, and show how the techniques can be used to custom-tailor newsfeeds based ...
Evgeniy Gabrilovich, Susan T. Dumais, Eric Horvitz
TMI
2008
66views more  TMI 2008»
14 years 9 months ago
Feature Normalization via Expectation Maximization and Unsupervised Nonparametric Classification For M-FISH Chromosome Images
Multicolor fluorescence in situ hybridization (M-FISH) techniques provide color karyotyping that allows simultaneous analysis of numerical and structural abnormalities of whole hum...
Hyohoon Choi, Alan C. Bovik, Kenneth R. Castleman
PODC
1999
ACM
15 years 2 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
EMNLP
2006
14 years 11 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson