Sciweavers

16666 search results - page 21 / 3334
» Descriptive and Computational Complexity
Sort
View
TSI
2008
89views more  TSI 2008»
13 years 10 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
COLING
2010
13 years 5 months ago
A framework for representing lexical resources
Our goal is to propose a description model for the lexicon. We describe a software framework for representing the lexicon and its variations called Proteus. Various examples show ...
Fabrice Issac
SIGGRAPH
1997
ACM
14 years 3 months ago
Rendering complex scenes with memory-coherent ray tracing
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
Matt Pharr, Craig E. Kolb, Reid Gershbein, Pat Han...
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
14 years 11 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu
JAPLL
2010
133views more  JAPLL 2010»
13 years 9 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez