Sciweavers

473 search results - page 54 / 95
» Computing shortest paths with uncertainty
Sort
View
73
Voted
MICCAI
2009
Springer
15 years 11 months ago
Brain Connectivity Using Geodesics in HARDI
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
Mickaël Péchaud, Maxime Descoteaux, Re...
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 11 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
PDP
2005
IEEE
15 years 3 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
WSC
2004
14 years 11 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol

Lecture Notes
443views
16 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount