774 search results - page 66 / 155 » A subdivision-based algorithm for the sparse resultant |
116
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
121
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
117
click to vote
IDEAL
2004
Springer
15 years 6 months ago
2004
Springer
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
111
click to vote
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
136
click to vote
JACM
2011
14 years 4 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...