Sciweavers

213 search results - page 10 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 1 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
DATAMINE
2010
133views more  DATAMINE 2010»
14 years 12 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
ICPR
2000
IEEE
16 years 25 days ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
WOTE
2010
14 years 10 months ago
Securing Optical-Scan Voting
Abstract. This paper presents a method for adding end-to-end verifiability to any optical-scan vote counting system. A serial number and set of letters, paired with every candidat...
Stefan Popoveniuc, Jeremy Clark, Richard Carback, ...
JMM2
2007
96views more  JMM2 2007»
14 years 11 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram