Sciweavers

2474 search results - page 210 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
FSTTCS
2009
Springer
16 years 29 days ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ICDCS
2003
IEEE
15 years 11 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
CVPR
2005
IEEE
16 years 8 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
IPPS
1999
IEEE
15 years 10 months ago
Recursive Individually Distributed Object
Abstract. Distributed Objects DO as de ned by OMG's CORBA architecture provide a model for object-oriented parallel distributed computing. The parallelism in this model howeve...
Z. George Mou
HPCC
2007
Springer
16 years 17 days ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham