Sciweavers

1220 search results - page 137 / 244
» Restricting grammatical complexity
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 8 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
COMPGEOM
2009
ACM
14 years 2 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
ISRR
2005
Springer
140views Robotics» more  ISRR 2005»
14 years 1 months ago
Tradeoffs Between Directed and Autonomous Driving on the Mars Exploration Rovers
NASA’s Mars Exploration Rovers (MER) have collected a great diversity of geological science results, thanks in large part to their surface mobility capabilities. The six wheel r...
Jeffrey J. Biesiadecki, Chris Leger, Mark W. Maimo...
TABLEAUX
2005
Springer
14 years 1 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann