Sciweavers

258 search results - page 52 / 52
» A Simple Framework for Natural Animation of Digitized Models
Sort
View
COLING
1996
13 years 7 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
EKAW
2004
Springer
13 years 11 months ago
Generating and Integrating Evidence for Ontology Mappings
For more than a decade, ontologies have been proposed as a means to enable sharing and reuse of knowledge. While originally relatively narrow information landscapes have been in mi...
Ludger van Elst, Malte Kiesel
ICALP
2010
Springer
13 years 11 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi