Sciweavers

4894 search results - page 768 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
MEMICS
2010
13 years 2 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
REALWSN
2010
13 years 2 months ago
Visibility Levels: Managing the Tradeoff between Visibility and Resource Consumption
Pre-deployment tests of sensor networks in indoor testbeds can only deliver a very approximate view of the correctness and performance of a deployed sensor network and it is theref...
Junyan Ma, Kay Römer
SIAMMAX
2010
116views more  SIAMMAX 2010»
13 years 2 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 12 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi