Sciweavers

855 search results - page 10 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
ICCV
1999
IEEE
15 years 11 months ago
The Hamilton-Jacobi Skeleton
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
Kaleem Siddiqi, Sylvain Bouix, Allen Tannenbaum, S...
FOGA
1998
14 years 11 months ago
Schemata as Building Blocks: Does Size Matter?
We analyze the schema theorem and the building block hypothesis using a recently derived, exact schemata evolution equation. We derive a new schema theorem based on the concept of...
Christopher R. Stephens, Henri Waelbroeck, R. Agui...
DAM
1999
105views more  DAM 1999»
14 years 9 months ago
The b-chromatic Number of a Graph
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
Robert W. Irving, David Manlove
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 2 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
JC
2011
87views more  JC 2011»
14 years 4 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski