2924 search results - page 376 / 585 » Lower Bounds in Distributed Computing |
126
click to vote
CHI
2007
ACM
16 years 5 months ago
2007
ACM
Selections and actions in GUI's are often separated ? i.e. an action or command typically follows a selection. This sequence imposes a lower bound on the interaction time tha...
134
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
142
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
121
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
125
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...