Sciweavers

280 search results - page 25 / 56
» Storage Alternatives for Large Structured State Spaces
Sort
View
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 6 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
VLDB
1987
ACM
90views Database» more  VLDB 1987»
14 years 3 days ago
Index Access with a Finite Buffer
: A buffer is a main-memory area used to reduce accessto disks. The buffer holds pages from secondary storage files. A processrequesting a page causesa fault if the pageis not in t...
Giovanni Maria Sacco
SPIRE
2005
Springer
14 years 2 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
ISEMANTICS
2010
13 years 7 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
ICTAI
2010
IEEE
13 years 6 months ago
A Closer Look at MOMDPs
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...
Mauricio Araya-López, Vincent Thomas, Olivi...