Sciweavers

1333 search results - page 127 / 267
» Not a Number of Floating Point Problems
Sort
View
PAMI
2010
249views more  PAMI 2010»
15 years 2 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
IPPS
2010
IEEE
15 years 1 months ago
Operating system resource management
From the point of view of an operating system, a computer is managed and optimized in terms of the application programming model and the management of system resources. For the TF...
Burton Smith
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 7 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
144
Voted
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 4 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 10 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...