221 search results - page 7 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
VL
2000
IEEE
13 years 11 months ago
2000
IEEE
Concurrent programming is a complex task, even with modern languages such as Java who provide languagebased support for multithreading and synchronization. In addition to typical ...
SEMCO
2007
IEEE
14 years 1 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
CHARME
2003
Springer
14 years 18 days ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...