Sciweavers

453 search results - page 67 / 91
» Tight bounds for the partial-sums problem
Sort
View
DKE
2007
105views more  DKE 2007»
13 years 8 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
TIT
2010
101views Education» more  TIT 2010»
13 years 3 months ago
Wideband fading channel capacity with training and partial feedback
We consider the capacity of a wideband fading channel with partial feedback, subject to an average power constraint. A doubly block Rayleigh fading model is assumed with finite co...
Manish Agarwal, Michael L. Honig
FSTTCS
2009
Springer
14 years 3 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
INFOCOM
2011
IEEE
12 years 12 months ago
There's something about MRAI: Timing diversity can exponentially worsen BGP convergence
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...
Alex Fabrikant, Umar Syed, Jennifer Rexford
ICC
2008
IEEE
105views Communications» more  ICC 2008»
14 years 3 months ago
Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems
Abstract—The downlink transmission in multi-user multipleinput multiple-output (MIMO) systems has been extensively studied from both communication-theoretic and information-theor...
Jubin Jose, Alexei Ashikhmint, Phil Whiting, Srira...