552 search results - page 94 / 111 » Constrained Shortest Path Computation |
80
Voted
TMC
2008
14 years 9 months ago
2008
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...
84
Voted
WEBI
2010
Springer
14 years 7 months ago
2010
Springer
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...
JMLR
2012
13 years 2 days ago
2012
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...
114
click to vote
ISCA
2012
IEEE
13 years 1 days ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...