Sciweavers

2588 search results - page 333 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
COCOON
1999
Springer
15 years 11 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 10 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
ESANN
1998
15 years 8 months ago
A neural approach to a sensor fusion problem
Our problem concerns the joint interpretation of UltraSonic and InfraRed measurements provided by a composite proximity sensor, in order to extract geometrical and morphological f...
Valentina Colla, Mirko Sgarbi, Leonardo Maria Reyn...
SAT
2009
Springer
153views Hardware» more  SAT 2009»
16 years 1 months ago
Does Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
Olaf Beyersdorff, Sebastian Müller
LREC
2010
151views Education» more  LREC 2010»
15 years 8 months ago
Developing an Expressive Speech Labeling Tool Incorporating the Temporal Characteristics of Emotion
A lot of research effort has been spent on the development of emotion theories and modeling, however, their suitability and applicability to expressions in human computer interact...
Stefan Scherer, Ingo Siegert, Lutz Bigalke, Sascha...