Sciweavers

15485 search results - page 361 / 3097
» Computing Optimal Subsets
Sort
View
PODC
1997
ACM
15 years 11 months ago
Computing Vector Functions on Anonymous Networks
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
Paolo Boldi, Sebastiano Vigna
JMIV
2010
78views more  JMIV 2010»
15 years 1 months ago
Unified Computation of Strict Maximum Likelihood for Geometric Fitting
A new numerical scheme is presented for strictly computing maximum likelihood (ML) of geometric fitting problems. Intensively studied in the past are those methods that first tran...
Kenichi Kanatani, Yasuyuki Sugaya
IPPS
2007
IEEE
16 years 1 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
IPPS
2006
IEEE
16 years 23 days ago
SmartNetSolve: high-level programming system for high performance grid computing
The paper presents SmartNetSolve, an extension of NetSolve, the programming system for high performance Grid computing. The extension is aimed at higher performance of Grid applic...
Thomas Brady, E. Konstantinov, Alexey L. Lastovets...
ICCV
2005
IEEE
16 years 10 days ago
Non-Orthogonal Binary Subspace and Its Applications in Computer Vision
This paper presents a novel approach that represents an image or a set of images using a nonorthogonal binary subspace (NBS) spanned by boxlike base vectors. These base vectors po...
Hai Tao, Ryan Crabb, Feng Tang