Sciweavers

2080 search results - page 268 / 416
» Measuring empirical computational complexity
Sort
View
AI
2011
Springer
15 years 1 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
FOCS
1995
IEEE
15 years 10 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
MM
2010
ACM
251views Multimedia» more  MM 2010»
15 years 6 months ago
A cognitive approach for effective coding and transmission of 3D video
Reliable delivery of 3D video contents to a wide set of users is expected to be the next big revolution in multimedia applications provided that it is possible to grant a certain ...
Simone Milani, Giancarlo Calvagno
CVPR
2007
IEEE
16 years 8 months ago
The effective resolution of correlation filters applied to natural scenes
In this paper, we measure the responses of image patches, used as filters, on different image ensembles and examine how the responses are affected by reducing the resolution of th...
Michel Vidal-Naquet, Manabu Tanifuji
ICCV
2003
IEEE
16 years 8 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer