Sciweavers

2657 search results - page 97 / 532
» On the complexity of hierarchical problem solving
Sort
View
ICIP
2009
IEEE
14 years 11 months ago
A contrario hierarchical image segmentation
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...
Juan Cardelino, Vicent Caselles, Marcelo Bertalm&i...
133
Voted
RT
1995
Springer
15 years 5 months ago
A Clustering Algorithm for Radiance Calculation in General Environments
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
François X. Sillion, George Drettakis, Cyri...
UIST
2004
ACM
15 years 7 months ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 1 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
MFCS
2010
Springer
14 years 12 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich