Sciweavers

959 search results - page 90 / 192
» Possible and Necessary h-Indices
Sort
View
CICLING
2009
Springer
14 years 9 months ago
Reducing the Plagiarism Detection Search Space on the Basis of the Kullback-Leibler Distance
Abstract. Automatic plagiarism detection considering a reference corpus compares a suspicious text to a set of original documents in order to relate the plagiarised fragments to th...
Alberto Barrón-Cedeño, Paolo Rosso, ...
CHI
2008
ACM
14 years 9 months ago
Talc: using desktop graffiti to fight software vulnerability
With the proliferation of computer security threats on the Internet, especially threats such as worms that automatically exploit software flaws, it is becoming more and more impor...
Kandha Sankarpandian, Travis Little, W. Keith Edwa...
RECOMB
2007
Springer
14 years 9 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
DCC
2005
IEEE
14 years 8 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 6 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams