Sciweavers

697 search results - page 110 / 140
» Convex Functions on Discrete Sets
Sort
View
SIAMAM
2000
90views more  SIAMAM 2000»
13 years 7 months ago
Local Strong Homogeneity of a Regularized Estimator
This paper deals with regularized pointwise estimation of discrete signals which contain large strongly homogeneous zones, where typically they are constant, or linear, or more gen...
Mila Nikolova
COMPGEOM
2006
ACM
13 years 11 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 24 days ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
TCS
2010
13 years 5 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
ICCS
2007
Springer
13 years 11 months ago
Adaptive Sparse Grid Classification Using Grid Environments
Common techniques tackling the task of classification in data mining employ ansatz functions associated to training data points to fit the data as well as possible. Instead, the fe...
Dirk Pflüger, Ioan Lucian Muntean, Hans-Joach...