15 search results - page 1 / 3 » World-Set Decompositions: Expressiveness and Efficient Algor... |
ICDT
2007
ACM
14 years 2 months ago
2007
ACM
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
ECML
2005
Springer
14 years 26 days ago
2005
Springer
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
AIPS
2009
14 years 22 hour ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...