Sciweavers

1168 search results - page 203 / 234
» Optimization strategies for complex queries
Sort
View
DIMACS
1996
13 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ICS
2010
Tsinghua U.
14 years 7 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 4 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 10 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
ICDE
2010
IEEE
235views Database» more  ICDE 2010»
14 years 9 months ago
Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds
Abstract-- Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or ...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...