Sciweavers

1757 search results - page 246 / 352
» Alternating Refinement Relations
Sort
View
133
Voted
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 9 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
IWPEC
2004
Springer
15 years 9 months ago
Chordless Paths Through Three Vertices
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
Robert Haas, Michael Hoffmann
KR
2004
Springer
15 years 9 months ago
Characterization of Semantics for Argument Systems
We consider Dung’s argumentation framework, in which an argument system consists of a set of arguments and a binary relation between arguments representing the notion of a con...
Philippe Besnard, Sylvie Doutre
147
Voted
RULEML
2004
Springer
15 years 9 months ago
SWRLp: An XML-Based SWRL Presentation Syntax
RuleML and SWRL are closely related rule markup languages that are growing in popularity particularly within the Semantic Web community. Both are based on XML and as such are more ...
Christopher J. Matheus
112
Voted
AUIC
2003
IEEE
15 years 9 months ago
Get a Way Back: Evaluating Retrieval from History Lists
Many user interfaces include history lists that help users retrieve temporally ordered information such as previously visited web pages, email messages, and recently used files. ...
Michael Jasonsmith, Andy Cockburn