Sciweavers

1086 search results - page 113 / 218
» Jug measuring: Algorithms and complexity
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Circular Earth Mover's Distance for the comparison of local features
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...
Julie Delon, Julien Rabin, Yann Gousseau
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
15 years 10 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
15 years 4 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin
SIGCSE
2005
ACM
102views Education» more  SIGCSE 2005»
15 years 3 months ago
Interpreting Java program runtimes
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
Stuart A. Hansen
VLDB
2005
ACM
114views Database» more  VLDB 2005»
15 years 3 months ago
Checking for k-Anonymity Violation by Views
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
Chao Yao, Xiaoyang Sean Wang, Sushil Jajodia