Sciweavers

922 search results - page 51 / 185
» Engineering a complex ontology with time
Sort
View
FSTTCS
2004
Springer
15 years 3 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
ECOOP
1998
Springer
15 years 2 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
COLING
1992
14 years 11 months ago
A Tense And Aspect Calculus
This paper focuses on a theory of tense and aspect (the representation of time in natural language) that attempts a formM representation of the relevant liltguistic devices as imp...
Diana Santos
ERCIM
2010
76views more  ERCIM 2010»
14 years 10 months ago
Digital Preservation of Interactive Multimedia Performances
Interactive multimedia performances are rapidly gaining ground within performing arts communities nowadays, mainly due to breakthroughs in humancomputer interaction technologies, ...
Kia Ng
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
15 years 11 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...