Sciweavers

1258 search results - page 88 / 252
» Architecture-driven Problem Decomposition
Sort
View
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
13 years 8 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
SIAMIS
2011
13 years 4 months ago
Locally Parallel Texture Modeling
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
Pierre Maurel, Jean-François Aujol, Gabriel...

Publication
363views
12 years 8 months ago
Detecting and Discriminating Behavioural Anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempor...
Chen Change Loy, Tao Xiang, Shaogang Gong
MANSCI
2007
139views more  MANSCI 2007»
13 years 9 months ago
A Market-Based Optimization Algorithm for Distributed Systems
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
Zhiling Guo, Gary J. Koehler, Andrew B. Whinston
DAM
2010
137views more  DAM 2010»
13 years 9 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...