2286 search results - page 115 / 458 » Algorithms for Categorical Equivalence |
158
click to vote
PRICAI
2000
Springer
15 years 9 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
202
click to vote
SCHEDULING
2008
15 years 5 months ago
2008
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
127
click to vote
BTW
2007
Springer
16 years 5 days ago
2007
Springer
: The paper presents YAWN, a system to convert the well-known and widely used Wikipedia collection into an XML corpus with semantically rich, self-explaining tags. We introduce alg...
143
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
129
click to vote
SARA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attrib...