Sciweavers

2498 search results - page 319 / 500
» Data Structures with Unpredictable Timing
Sort
View
DEXA
2004
Springer
159views Database» more  DEXA 2004»
15 years 10 months ago
Adaptive Double Routing Indices: Combining Effectiveness and Efficiency in P2P Systems
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to informati...
Stéphane Bressan, Achmad Nizar Hidayanto, C...
IMC
2007
ACM
15 years 8 months ago
Interference map for 802.11 networks
The interference map of an 802.11 network is a collection of data structures that can help heuristics for routing, channel assignment and call admission in dense wireless networks...
Dragos Niculescu
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
15 years 7 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty
150
Voted
OPODIS
2004
15 years 7 months ago
Self-tuning Reactive Distributed Trees for Counting and Balancing
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
Phuong Hoai Ha, Marina Papatriantafilou, Philippas...
SPIESR
2003
165views Database» more  SPIESR 2003»
15 years 7 months ago
Analysis of musical expression in audio signals
In western art music, composers communicate their work to performers via a standard notation which specificies the musical pitches and relative timings of notes. This notation ma...
Simon Dixon