Sciweavers

699 search results - page 27 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
POPL
2012
ACM
13 years 5 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
ORL
1998
130views more  ORL 1998»
14 years 9 months ago
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
Jack Brimberg, Reuven Chen, Doron Chen
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
15 years 10 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
CVPR
2011
IEEE
14 years 1 months ago
Global Optimization for Optimal Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
Daniel Pizarro, Adrien Bartoli