Sciweavers

3415 search results - page 453 / 683
» Lower bounds on kernelization
Sort
View
POPL
2010
ACM
16 years 3 months ago
Threesomes, With and Without Blame
Abstract. The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides a...
Jeremy G. Siek, Philip Wadler
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 3 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 3 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
ICDCN
2010
Springer
16 years 1 months ago
Scheduling in Multi-Channel Wireless Networks
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...
Vartika Bhandari, Nitin H. Vaidya
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
16 years 1 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held