Sciweavers

4118 search results - page 85 / 824
» Efficient Algorithms for Airline Problem
Sort
View
196
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Efficient image reconstruction under sparsity constraints with application to MRI and bioluminescence tomography
Most bioimaging modalities rely on indirect measurements of the quantity under investigation. The image is obtained as the result of an optimization problem involving a physical m...
Matthieu Guerquin-Kern, Jean-Charles Baritaux, Mic...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 3 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
158
Voted
AI
2008
Springer
15 years 3 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
271
Voted

Lecture Notes
443views
17 years 1 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
122
Voted
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 3 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...