Sciweavers

4926 search results - page 397 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
SPAA
2004
ACM
15 years 10 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
RECOMB
2004
Springer
16 years 4 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
SIVP
2010
118views more  SIVP 2010»
15 years 2 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray
162
Voted

Publication
350views
16 years 9 months ago
Programmable Aperture Photography: Multiplexed Light Field Acquisition
In this paper, we present a system including a novel component called programmable aperture and two associated post-processing algorithms for high-quality light field acquisition. ...
Chia-Kai Liang and Tai-Hsu Lin and Bing-Yi Wong a...
ICIP
2004
IEEE
16 years 6 months ago
Fast motion estimation and motion segmentation using multi-scale approach
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...
Cédric Demonceaux, Djemâa Kachi-Akkou...