1007 search results - page 177 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
CIDM
2007
IEEE
15 years 8 months ago
2007
IEEE
— With growing amount of data gathered nowadays, the need for efficient data mining methodologies is getting more and more common. There is a large number of different classifi...
113
click to vote
AAAI
2010
15 years 3 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
149
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
130
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
145
click to vote
OPODIS
2010
15 years 3 days ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...