Sciweavers

389 search results - page 22 / 78
» Computational Alternatives to Random Number Generators
Sort
View
JCS
2011
156views more  JCS 2011»
13 years 2 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 1 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 20 days ago
On Computing Condensed Frequent Pattern Bases
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
CVPR
2010
IEEE
14 years 4 months ago
A Generative Perspective on MRFs in Low-Level Vision
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
Uwe Schmidt, Qi Gao, Stefan Roth