Sciweavers

2342 search results - page 333 / 469
» Sublinear geometric algorithms
Sort
View
CAD
2008
Springer
15 years 3 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
COR
2006
94views more  COR 2006»
15 years 3 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 3 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
IJON
2008
121views more  IJON 2008»
15 years 3 months ago
Locality sensitive semi-supervised feature selection
In many computer vision tasks like face recognition and image retrieval, one is often confronted with high-dimensional data. Procedures that are analytically or computationally ma...
Jidong Zhao, Ke Lu, Xiaofei He
JDA
2008
72views more  JDA 2008»
15 years 3 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin