Sciweavers

4298 search results - page 44 / 860
» Measurable chromatic numbers
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 4 days ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
CIE
2009
Springer
15 years 6 months ago
Numberings and Randomness
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
Paul Brodhead, Bjørn Kjos-Hanssen
EWSN
2009
Springer
16 years 11 days ago
The Minimum Number of Sensors - Interpolation of Spatial Temperature Profiles in Chilled Transports
Wireless sensor networks are an important tool for the supervision of cool chains. Previous research with a high number of measurement points revealed spatial temperature deviation...
Reiner Jedermann, Walter Lang
CVPR
2005
IEEE
16 years 1 months ago
Using Particles to Track Varying Numbers of Interacting People
In this paper, we present a Bayesian framework for the fully automatic tracking of a variable number of interacting targets using a fixed camera. This framework uses a joint multi...
Kevin Smith, Daniel Gatica-Perez, Jean-Marc Odobez
ALT
1994
Springer
15 years 4 months ago
Program Synthesis in the Presence of Infinite Number of Inaccuracies
Most studies modeling inaccurate data in Gold style learning consider cases in which the number of inaccuracies is finite. The present paper argues that this approach is not reaso...
Sanjay Jain