Sciweavers

467 search results - page 82 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
COMCOM
2006
80views more  COMCOM 2006»
13 years 6 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
TMC
2008
91views more  TMC 2008»
13 years 6 months ago
Dynamic Forwarding over Tree-on-DAG for Scalable Data Aggregation in Sensor Networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
Kai-Wei Fan, Sha Liu, Prasun Sinha
WEBI
2010
Springer
13 years 4 months ago
MQuery: Fast Graph Query via Semantic Indexing for Mobile Context
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
Yuan Zhang, Ning Zhang, Jie Tang, Jinghai Rao, Wen...
JMLR
2012
11 years 9 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
11 years 9 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...