Sciweavers

2434 search results - page 64 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
COCOON
2005
Springer
15 years 5 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
CVPR
2009
IEEE
16 years 10 months ago
Half-integrality based algorithms for Cosegmentation of Images
We study the cosegmentation problem where the objective is to segment the same object (i.e., region) from a pair of images. The segmentation for each image can be cast using a p...
Chuck R. Dyer, Lopamudra Mukherjee, Vikas Singh
BIOINFORMATICS
2006
92views more  BIOINFORMATICS 2006»
15 years 3 months ago
What should be expected from feature selection in small-sample settings
Motivation: High-throughput technologies for rapid measurement of vast numbers of biological variables offer the potential for highly discriminatory diagnosis and prognosis; howev...
Chao Sima, Edward R. Dougherty
RSA
2006
68views more  RSA 2006»
15 years 3 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
123
Voted
FLAIRS
2007
15 years 5 months ago
A Distance-Based Over-Sampling Method for Learning from Imbalanced Data Sets
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
Jorge de la Calleja, Olac Fuentes