Sciweavers

1538 search results - page 169 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
CIKM
2007
Springer
15 years 7 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
IPPS
1999
IEEE
15 years 8 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
DAC
2008
ACM
16 years 4 months ago
Multithreaded simulation for synchronous dataflow graphs
Synchronous dataflow (SDF) has been successfully used in design tools for system-level simulation of wireless communication systems. Modern wireless communication standards involv...
Chia-Jui Hsu, José Luis Pino, Shuvra S. Bha...
234
Voted
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 4 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
TASLP
2008
75views more  TASLP 2008»
15 years 3 months ago
Efficient Index-Based Audio Matching
Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even th...
Frank Kurth, Meinard Müller