Sciweavers

2286 search results - page 115 / 458
» Algorithms for Categorical Equivalence
Sort
View
PRICAI
2000
Springer
15 years 1 months ago
A POMDP Approximation Algorithm That Anticipates the Need to Observe
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...
Valentina Bayer Zubek, Thomas G. Dietterich
SCHEDULING
2008
97views more  SCHEDULING 2008»
14 years 9 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
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...
Philip Kaminsky, Zu-Hsu Lee
BTW
2007
Springer
122views Database» more  BTW 2007»
15 years 4 months ago
YAWN: A Semantically Annotated Wikipedia XML Corpus
: 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...
Ralf Schenkel, Fabian M. Suchanek, Gjergji Kasneci
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Approximate Colored Range Queries
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...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
SARA
2005
Springer
15 years 3 months ago
The Cruncher: Automatic Concept Formation Using Minimum Description Length
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...
Marc Pickett, Tim Oates