Sciweavers

79 search results - page 2 / 16
» A Result in Dual Ramsey Theory
Sort
View
JCT
2006
83views more  JCT 2006»
13 years 7 months ago
The mathematics of Bruce Rothschild
A review is given of some of the mathematical research of Bruce Rothschild, emphasizing his results in combinatorial theory, especially that part known as Ramsey Theory. Special em...
Neil Hindman
ECCV
2002
Springer
14 years 9 months ago
Revisiting Single-View Shape Tensors: Theory and Applications
Abstract. Given the projection of a su cient numberof points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates...
Anat Levin, Amnon Shashua
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
RSA
2011
121views more  RSA 2011»
13 years 2 months ago
Ramsey games with giants
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
Tom Bohman, Alan M. Frieze, Michael Krivelevich, P...
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore