Sciweavers

2843 search results - page 430 / 569
» Interpolation by geometric algorithm
Sort
View
75
Voted
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
15 years 7 days ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
SIGIR
2010
ACM
14 years 11 months ago
A joint probabilistic classification model for resource selection
Resource selection is an important task in Federated Search to select a small number of most relevant information sources. Current resource selection algorithms such as GlOSS, COR...
Dzung Hong, Luo Si, Paul Bracke, Michael Witt, Tim...
CAD
2008
Springer
14 years 11 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»
14 years 11 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»
14 years 11 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