8647 search results - page 514 / 1730 » The Container Selection Problem |
175
click to vote
RTA
2004
Springer
16 years 9 days ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
171
click to vote
ECSQARU
2003
Springer
16 years 5 days ago
2003
Springer
We introduce a set of transformations on the set of all probability distributions over a finite state space, and show that these transformations are the only ones that preserve c...
191
click to vote
UAI
1996
15 years 8 months ago
1996
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
175
click to vote
IANDC
2008
15 years 7 months ago
2008
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
178
click to vote
IJMC
2006
15 years 7 months ago
2006
: M-learning is a rapidly expanding recently domain. Provoked by the fast advances of mobile technologies different applications and systems are developed continuously. Here we add...