Sciweavers

159 search results - page 14 / 32
» Geometric Bounds for Generalization in Boosting
Sort
View
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
14 years 1 months ago
Accelerating geometric queries using the GPU
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
Adarsh Krishnamurthy, Sara McMains, Kirk Haller
COMGEO
2007
ACM
13 years 7 months ago
Geometric spanners with applications in wireless networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
ICMCS
2006
IEEE
145views Multimedia» more  ICMCS 2006»
14 years 1 months ago
A New Study on Distance Metrics as Similarity Measurement
Distance metric is widely used in similarity estimation. In this paper we find that the most popular Euclidean and Manhattan distance may not be suitable for all data distribution...
Jie Yu, Jaume Amores, Nicu Sebe, Qi Tian
CPAIOR
2006
Springer
13 years 11 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
ICALP
1992
Springer
13 years 11 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao