Sciweavers

608 search results - page 25 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 1 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
IDA
2009
Springer
14 years 5 days ago
Image Source Separation Using Color Channel Dependencies
We investigate the problem of source separation in images in the Bayesian framework using the color channel dependencies. As a case in point we consider the source separation of co...
Koray Kayabol, Ercan E. Kuruoglu, Bülent Sank...
RC
2006
88views more  RC 2006»
13 years 7 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
ESORICS
2002
Springer
14 years 7 months ago
Hamming Weight Attacks on Cryptographic Hardware - Breaking Masking Defense
It is believed that masking is an effective countermeasure against power analysis attacks: before a certain operation involving a key is performed in a cryptographic chip, the inpu...
Marcin Gomulkiewicz, Miroslaw Kutylowski