Sciweavers

1187 search results - page 87 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
COLING
1996
15 years 2 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
MM
2005
ACM
111views Multimedia» more  MM 2005»
15 years 7 months ago
A flexible system for creating music while interacting with the computer
Music is a very important part of our lives. People enjoy listening to the music, and many of us find a special pleasure in creating the music. Computers further extended many asp...
Zeljko Obrenovic
CVPR
2009
IEEE
15 years 8 months ago
Resolution-Invariant Image Representation and its applications
We present a Resolution-Invariant Image Representation (RIIR) framework in this paper. The RIIR framework includes the methods of building a set of multi-resolution bases from tra...
Jinjun Wang, Shenghuo Zhu, Yihong Gong
FSTTCS
2006
Springer
15 years 5 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
IJON
2007
74views more  IJON 2007»
15 years 1 months ago
Visual object concept discovery: Observations in congenitally blind children, and a computational approach
Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnec...
Jake V. Bouvrie, Pawan Sinha