Sciweavers

807 search results - page 57 / 162
» Competition Adds Complexity
Sort
View
90
Voted
SIGCOMM
1997
ACM
15 years 6 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
CAISE
1994
Springer
15 years 6 months ago
Information Systems Modernization
Put yourself in the place of a corporate Chief Information Officer or government agency Information Resource manager... The new budget managers are looking for a quick kill. Your ...
Anthony I. Wasserman
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 2 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
99
Voted
ICCD
2005
IEEE
119views Hardware» more  ICCD 2005»
15 years 11 months ago
Deployment of Better Than Worst-Case Design: Solutions and Needs
The advent of nanometer feature sizes in silicon fabrication has triggered a number of new design challenges for computer designers. These challenges include design complexity and...
Todd M. Austin, Valeria Bertacco
CVPR
2010
IEEE
15 years 11 months ago
Locality-constrained Linear Coding for Image Classification
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
Jinjun Wang, Jianchao Yang, Kai Yu, Fengjun Lv