Sciweavers

160 search results - page 21 / 32
» Improved Single and Multiple Approximate String Matching
Sort
View
FOCS
2003
IEEE
14 years 15 hour ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
AVBPA
2001
Springer
146views Biometrics» more  AVBPA 2001»
13 years 11 months ago
Information Fusion in Biometrics
User verification systems that use a single biometric indicator often have to contend with noisy sensor data, restricted degrees of freedom, non-universality of the biometric tra...
Arun Ross, Anil K. Jain, Jian Zhong Qian
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 6 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
WWW
2009
ACM
14 years 7 months ago
Less talk, more rock: automated organization of community-contributed collections of concert videos
We describe a system for synchronization and organization of user-contributed content from live music events. We start with a set of short video clips taken at a single event by m...
Lyndon S. Kennedy, Mor Naaman
ML
2008
ACM
162views Machine Learning» more  ML 2008»
13 years 6 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch