Sciweavers

464 search results - page 26 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
15 years 10 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
MOR
2007
149views more  MOR 2007»
14 years 9 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
FGR
2006
IEEE
169views Biometrics» more  FGR 2006»
15 years 3 months ago
Combining PCA and LFA for Surface Reconstruction from a Sparse Set of Control Points
This paper presents a novel method for 3D surface reconstruction based on a sparse set of 3D control points. For object classes such as human heads, prior information about the cl...
Reinhard Knothe, Sami Romdhani, Thomas Vetter
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
14 years 10 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
ICPR
2000
IEEE
15 years 10 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes