Sciweavers

218 search results - page 30 / 44
» Composite Binary Losses
Sort
View
TWC
2008
112views more  TWC 2008»
13 years 7 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis
ICIP
2002
IEEE
14 years 9 months ago
Anti-collusion codes: multi-user and multimedia perspectives
Digital fingerprinting is an effective method to identify users who might try to redistribute multimedia content, such as images and video. These fingerprints are typically embedd...
Wade Trappe, Min Wu, K. J. Ray Liu
KDD
2004
ACM
110views Data Mining» more  KDD 2004»
14 years 7 months ago
Generalizing the notion of support
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
Michael Steinbach, Pang-Ning Tan, Hui Xiong, Vipin...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
SOFSEM
2007
Springer
14 years 1 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan