1802 search results - page 227 / 361 » Complexity Theory for Operators in Analysis |
177
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
This presentation will discuss several database technology challenges that are faced when building a data warehouse. It will touch on the challenges posed by high capacity drives ...
208
click to vote
APLAS
2010
ACM
15 years 5 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
178
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
194
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
176
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...