Sciweavers

212 search results - page 29 / 43
» Complexity Parameters for First-Order Classes
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 2 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
ISSTA
2012
ACM
13 years 2 months ago
A quantitative study of accuracy in system call-based malware detection
Over the last decade, there has been a significant increase in the number and sophistication of malware-related attacks and infections. Many detection techniques have been propos...
Davide Canali, Andrea Lanzi, Davide Balzarotti, Ch...
BMCBI
2010
121views more  BMCBI 2010»
14 years 12 months ago
MS4 - Multi-Scale Selector of Sequence Signatures: An alignment-free method for classification of biological sequences
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 4 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 7 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson