Sciweavers

1272 search results - page 95 / 255
» The Set Cover with Pairs Problem
Sort
View
101
Voted
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 1 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
99
Voted
ICPR
2002
IEEE
16 years 1 months ago
Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
David B. Cooper, Andrew R. Willis, Stuart Andrews,...
99
Voted
ICIP
2002
IEEE
16 years 2 months ago
Fingerprint matching based on error propagation
Fingerprint matching is one of the most important modules in automatic fingerprint identification systems (AFIS). Traditional methods treat this problem as point pattern matching,...
Ying Hao, Tieniu Tan, Yunhong Wang
ALT
2004
Springer
15 years 4 months ago
Applications of Regularized Least Squares to Classification Problems
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
Nicolò Cesa-Bianchi
INFSOF
2008
85views more  INFSOF 2008»
15 years 10 days ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li