Sciweavers

485 search results - page 88 / 97
» DTI Connectivity by Segmentation
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 7 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
IJON
2008
186views more  IJON 2008»
13 years 7 months ago
Computational analysis and learning for a biologically motivated model of boundary detection
In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient ...
Iasonas Kokkinos, Rachid Deriche, Olivier D. Fauge...
IEPOL
2006
67views more  IEPOL 2006»
13 years 7 months ago
Platform competition and broadband uptake: Theory and empirical evidence from the European union
Broadband access provides users with high speed, always-on connectivity to the Internet. Due to its superiority, broadband is seen as the way for consumers and firms to exploit th...
Walter Distaso, Paolo Lupi, Fabio M. Manenti
JGAA
2008
100views more  JGAA 2008»
13 years 7 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
CPHYSICS
2007
86views more  CPHYSICS 2007»
13 years 7 months ago
Are polymer melts "ideal"
It is commonly accepted that in concentrated solutions or melts high-molecular weight polymers display randomwalk conformational properties without long-range correlations between...
Joachim Paul Jakob Wittmer, Philippe Beckrich, F. ...