Sciweavers

611 search results - page 58 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
CIE
2011
Springer
12 years 9 months ago
Automatic Learners with Feedback Queries
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukh...
EDBT
2010
ACM
206views Database» more  EDBT 2010»
14 years 4 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
WG
2009
Springer
14 years 3 months ago
Chordal Digraphs
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
Daniel Meister, Jan Arne Telle
GROUP
1999
ACM
14 years 1 months ago
From description to requirements: an activity theoretic perspective
This paper demonstrates how activity theoretic concepts can be used in conjunction with an ethnographically informed approach to derive requirements on a work situation. We presen...
Phil Turner, Susan Turner, Julie Horton
BIRTHDAY
2005
Springer
14 years 2 months ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....