Sciweavers

1050 search results - page 89 / 210
» The problem with rights expression languages
Sort
View
ICALP
1995
Springer
15 years 1 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
COLING
1996
14 years 11 months ago
On Inference-Based Procedures for Lexical Disambiguation
In this paper we sketch a decidable inference-based procedure for lexical disambiguation which operates on semantic representations of discourse and conceptual knowledge, In contr...
Jürgen Wedekind
ACTA
2010
104views more  ACTA 2010»
14 years 10 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
IJMMS
2010
161views more  IJMMS 2010»
14 years 8 months ago
Persuasive robotic assistant for health self-management of older adults: Design and evaluation of social behaviors
Daily health self-management, such as the harmonization of food, exercise and medication, is a major problem for a large group of older adults with obesity or diabetics. Computer-...
Rosemarijn Looije, Mark A. Neerincx, Fokie Cnossen
PLDI
2006
ACM
15 years 3 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein