Sciweavers

8512 search results - page 177 / 1703
» Computing Theory With Relevance
Sort
View
122
Voted
GD
2004
Springer
15 years 10 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
GIAE
2004
Springer
159views Mathematics» more  GIAE 2004»
15 years 10 months ago
A Survey of Moving Frames
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
Peter J. Olver
TCS
2008
15 years 4 months ago
Constructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
Arnon Avron
BIRTHDAY
2000
Springer
15 years 9 months ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter
CHI
2003
ACM
16 years 5 months ago
Post-cognitivist HCI: second-wave theories
Historically, the dominant paradigm in HCI, when it appeared as a field in early 80s, was information processing ("cognitivist") psychology. In recent decades, as the fo...
Bonnie A. Nardi, Edwin Hutchins, James D. Hollan, ...