Sciweavers

331 search results - page 41 / 67
» New Results on the Pseudorandomness of Some Blockcipher Cons...
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
A robust boosting tracker with minimum error bound in a co-training framework
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
Rong Liu, Jian Cheng, Hanqing Lu
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 9 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
BMCBI
2005
87views more  BMCBI 2005»
13 years 7 months ago
ProfNet, a method to derive profile-profile alignment scoring functions that improves the alignments of distantly related protei
Background: Profile-profile methods have been used for some years now to detect and align homologous proteins. The best such methods use information from the background distributi...
Tomas Ohlson, Arne Elofsson
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
AAAI
1994
13 years 9 months ago
Learning to Reason
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
Roni Khardon, Dan Roth