Sciweavers

1236 search results - page 70 / 248
» On the Hamkins approximation property
Sort
View
COMPUTING
2006
119views more  COMPUTING 2006»
15 years 6 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
ICALP
2011
Springer
14 years 9 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
CORR
2006
Springer
145views Education» more  CORR 2006»
15 years 6 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
ICONIP
2004
15 years 7 months ago
Variational Information Maximization for Neural Coding
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...
Felix V. Agakov, David Barber
COMGEO
2007
ACM
15 years 6 months ago
Learning smooth shapes by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...