1439 search results - page 91 / 288 » Fast approximation of centrality |
102
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a time-lapse collection and reconstruction technique that allows following embryonic heart development at any computationally halted heart contraction state. The centra...
TIP
1998
14 years 9 months ago
1998
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
VISUALIZATION
1997
IEEE
15 years 2 months ago
1997
IEEE
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...
NIPS
2004
14 years 11 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...