1629 search results - page 288 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
160
Voted
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
146
click to vote
CCS
2007
ACM
16 years 8 days ago
2007
ACM
The paper describes a Non-Intrusive IP traceback scheme which uses sampled traffic under non-attack conditions to build and maintains caches of the valid source addresses transiti...
162
click to vote
HPCC
2007
Springer
16 years 7 days ago
2007
Springer
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...
139
Voted
DATE
2006
IEEE
16 years 4 days ago
2006
IEEE
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...
159
click to vote
SAMOS
2004
Springer
15 years 11 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...