Sciweavers

1272 search results - page 175 / 255
» Approximate Parameterized Matching
Sort
View
NECO
2011
14 years 10 months ago
Least Squares Estimation Without Priors or Supervision
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
Martin Raphan, Eero P. Simoncelli
144
Voted
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 5 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
SIGIR
1997
ACM
15 years 8 months ago
Learning Routing Queries in a Query Zone
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
Amit Singhal, Mandar Mitra, Chris Buckley
155
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 6 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
160
Voted
ICCV
2009
IEEE
16 years 8 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...