Sciweavers

1299 search results - page 11 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
MOR
2010
120views more  MOR 2010»
14 years 8 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
GLOBECOM
2009
IEEE
14 years 7 months ago
Time-Critical Data Dissemination in Cooperative Peer-to-Peer Systems
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
Chi-Jen Wu, Cheng-Ying Li, Kai-Hsiang Yang, Jan-Mi...
VISUALIZATION
1999
IEEE
15 years 1 months ago
Rendering on a Budget: A Framework for Time-Critical Rendering
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
James T. Klosowski, Cláudio T. Silva
IPPS
2010
IEEE
14 years 7 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
PRL
2007
158views more  PRL 2007»
14 years 9 months ago
Stability and convergence of the level set method in computer vision
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
Kunal N. Chaudhury, K. R. Ramakrishnan