Sciweavers

1809 search results - page 150 / 362
» Weakly Computable Real Numbers
Sort
View
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
15 years 4 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
SACI
2009
IEEE
15 years 11 months ago
Experiments on a grid layer prototype for shared data programming model
—In the grid context, there is little support for programming paradigms such as shared data or associative programming. We have previously proposed an original idea to attack sha...
Dacian Tudor, Georgiana Macariu, Wolfgang Schreine...
WACV
2005
IEEE
15 years 10 months ago
Automatic Augmentation and Meshing of Sparse 3D Scene Structure
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
Oli Cooper, Neill W. Campbell, David P. Gibson
EUROCAST
2005
Springer
86views Hardware» more  EUROCAST 2005»
15 years 10 months ago
Convergence of Iterations
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
Paul Cull
INFOCOM
2010
IEEE
15 years 2 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...