Sciweavers

2714 search results - page 53 / 543
» On the Notion of Value Object
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 9 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
TARK
2005
Springer
15 years 3 months ago
Interactive unawareness revisited
We analyze a model of interactive unawareness introduced by Heifetz, Meier and Schipper (HMS). We consider two axiomatizations for their model, which capture different notions of ...
Joseph Y. Halpern, Leandro Chaves Rêgo
IJDAR
2006
245views more  IJDAR 2006»
14 years 9 months ago
Object count/area graphs for the evaluation of object detection and segmentation algorithms
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
Christian Wolf, Jean-Michel Jolion
CSCLP
2008
Springer
14 years 11 months ago
Robust Solutions in Unstable Optimization Problems
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 7 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra