Sciweavers

495 search results - page 65 / 99
» Data exchange: computing cores in polynomial time
Sort
View
HYBRID
2004
Springer
14 years 2 months ago
Inference Methods for Autonomous Stochastic Linear Hybrid Systems
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
Hamsa Balakrishnan, Inseok Hwang, Jung Soon Jang, ...
COMPGEOM
2009
ACM
14 years 1 months ago
Kinetic spanners in Rd
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
Mohammad Ali Abam, Mark de Berg
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 9 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
14 years 13 days ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
CLOUD
2010
ACM
14 years 1 months ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...