Sciweavers

10289 search results - page 190 / 2058
» Standard bases in K
Sort
View
DSN
2002
IEEE
15 years 11 months ago
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
Philip Koopman
JSYML
2002
170views more  JSYML 2002»
15 years 6 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
TKDE
2010
168views more  TKDE 2010»
15 years 4 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
WINE
2010
Springer
153views Economy» more  WINE 2010»
15 years 4 months ago
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...
FOCS
2005
IEEE
16 years 2 days ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit