Sciweavers

2041 search results - page 408 / 409
» Balance Machines: Computing = Balancing
Sort
View
AI
2012
Springer
13 years 5 months ago
Plan recognition in exploratory domains
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Ande...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 1 days ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 10 hour ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
EDBT
2012
ACM
246views Database» more  EDBT 2012»
12 years 12 months ago
"Cut me some slack": latency-aware live migration for databases
Cloud-based data management platforms often employ multitenant databases, where service providers achieve economies of scale by consolidating multiple tenants on shared servers. I...
Sean Kenneth Barker, Yun Chi, Hyun Jin Moon, Hakan...
FSTTCS
2009
Springer
15 years 4 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...