2996 search results - page 328 / 600 » Numberings and Randomness |
174
click to vote
ASPDAC
2009
ACM
15 years 8 months ago
2009
ACM
Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices w...
171
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
According to Shannon Sampling Theory, Fourier interpolation is the optimal way to reach subpixel accuracy from a properly-sampled digital image. However, for most images this inte...
165
click to vote
CC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
142
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...