Sciweavers

4744 search results - page 54 / 949
» Connected Computing
Sort
View
CVPR
2011
IEEE
14 years 9 months ago
Connecting Non-Quadratic Variational Models and MRFs
Spatially-discrete Markov random fields (MRFs) and spatially-continuous variational approaches are ubiquitous in low-level vision, including image restoration, segmentation, opti...
Kevin Schelten, Stefan Roth
IJON
2006
54views more  IJON 2006»
15 years 6 months ago
Self-organization of hierarchical visual maps with feedback connections
Visual areas in primates are known to have reciprocal connections. While the feedforward bottom-up processing of visual information has been studied extensively for decades, littl...
Yiu-Fai Sit, Risto Miikkulainen
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 6 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
PPSC
1993
15 years 7 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon
TWC
2008
95views more  TWC 2008»
15 years 5 months ago
The Impact of Channel Randomness on Coverage and Connectivity of Ad Hoc and Sensor Networks
Abstract-- In this paper, we first present an analytical procedure for the computation of the node isolation probability and coverage in an ad hoc network in the presence of channe...
Daniele Miorandi