Sciweavers

147 search results - page 25 / 30
» Alternative techniques to solve hard multi-objective optimiz...
Sort
View
AAAI
2006
13 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICCV
2003
IEEE
14 years 19 days ago
Paracatadioptric Camera Calibration Using Lines
Paracatadioptric sensors combine a parabolic shaped mirror and a camera inducing an orthographic projection. Such a configuration provides a wide field of view while keeping a s...
João P. Barreto, Helder Araújo
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye