Sciweavers

9842 search results - page 170 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
ECCV
2010
Springer
14 years 22 days ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
WSCG
2004
148views more  WSCG 2004»
13 years 11 months ago
Inverse Rendering of Polished Materials under Constant Complex Uncontrolled Illumination
Inverse rendering infers realistic descriptions of illumination and material properties from photographs. However, the applicability of state of the art inverse rendering algorith...
Michael Bang Nielsen, Anders Brodersen
ATAL
2010
Springer
13 years 11 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
BIOSYSTEMS
2007
109views more  BIOSYSTEMS 2007»
13 years 10 months ago
Complex adaptation and system structure
The structural organization of biological systems is one of nature’s most fascinating aspects, but its origin and functional role is not yet fully understood. For instance, basi...
Marc Toussaint, Werner von Seelen