Sciweavers

3894 search results - page 517 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View

Publication
433views
16 years 16 days ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
AAMAS
2011
Springer
14 years 11 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
CEC
2011
IEEE
14 years 4 months ago
Trainer selection strategies for coevolving rank predictors
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Daniel L. Ly, Hod Lipson
ICALP
2010
Springer
15 years 9 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
169
Voted
ICPADS
1994
IEEE
15 years 8 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...