820 search results - page 104 / 164 » Inducing Temporal Graphs |
125
click to vote
IJON
2007
15 years 3 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
136
Voted
JPDC
2007
15 years 3 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
153
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
102
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
142
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....