Sciweavers

1132 search results - page 37 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ADCM
2008
119views more  ADCM 2008»
13 years 6 months ago
Bounds on the dimensions of trivariate spline spaces
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
Peter Alfeld, Larry L. Schumaker
COLT
2001
Springer
13 years 12 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber
EPEW
2007
Springer
14 years 1 months ago
Closed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
Ana Busic, Nihal Pekergin
DAM
2007
141views more  DAM 2007»
13 years 7 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
NIPS
2004
13 years 8 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg