Sciweavers

1162 search results - page 189 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
EMMCVPR
2009
Springer
14 years 2 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
DAIS
2009
13 years 9 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
ICPP
2005
IEEE
14 years 1 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao
APLAS
2004
ACM
14 years 1 months ago
Protocol Specialization
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
Matthias Neubauer, Peter Thiemann
TSP
2008
117views more  TSP 2008»
13 years 7 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do