18306 search results - page 3561 / 3662 » Algorithmics in Exponential Time |
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
CCA
2009
Springer
14 years 1 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...