4541 search results - page 763 / 909 » Cache-Oblivious Algorithms and Data Structures |
174
Voted
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
170
click to vote
CP
2007
Springer
16 years 19 days ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
221
Voted
ESA
2007
Springer
16 years 19 days ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
197
Voted
ICA
2007
Springer
16 years 18 days ago
2007
Springer
This paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on mo...
167
click to vote
WADS
2007
Springer
16 years 17 days ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...