Sciweavers

9572 search results - page 320 / 1915
» Cover Algorithms and Their Combination
Sort
View
ACL
2001
15 years 8 months ago
Evaluating Smoothing Algorithms against Plausibility Judgements
Previous research has shown that the plausibility of an adjective-noun combination is correlated with its corpus co-occurrence frequency. In this paper, we estimate the co-occurre...
Maria Lapata, Frank Keller, Scott McDonald
LATIN
2004
Springer
16 years 1 days ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CVPR
2008
IEEE
16 years 8 months ago
IM2GPS: estimating geographic information from a single image
Estimating geographic information from an image is an excellent, difficult high-level computer vision problem whose time has come. The emergence of vast amounts of geographically-...
James Hays, Alexei A. Efros
ICML
2004
IEEE
16 years 7 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik