Sciweavers

3422 search results - page 411 / 685
» Random Subset Optimization
Sort
View
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 8 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 2 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
129
Voted
BMCBI
2006
110views more  BMCBI 2006»
15 years 4 months ago
Bias in error estimation when using cross-validation for model selection
Background: Cross-validation (CV) is an effective method for estimating the prediction error of a classifier. Some recent articles have proposed methods for optimizing classifiers...
Sudhir Varma, Richard Simon
CVPR
2009
IEEE
16 years 11 months ago
Visibility Constraints on Features of 3D Objects
To recognize three-dimensional objects it is important to model how their appearances can change due to changes in viewpoint. A key aspect of this involves understanding which o...
Ronen Basri, Pedro F. Felzenszwalb, Ross B. Girshi...