Sciweavers

2080 search results - page 143 / 416
» Measuring empirical computational complexity
Sort
View
KAIS
2008
81views more  KAIS 2008»
15 years 4 months ago
Maximum entropy based significance of itemsets
We consider the problem of defining the significance of an itemset. We say that the itemset is significant if we are surprised by its frequency when compared to the frequencies of ...
Nikolaj Tatti
CVPR
2009
IEEE
16 years 11 months ago
SIFT-Rank: Ordinal Description for Invariant Feature Correspondence
This paper investigates ordinal image description for invariant feature correspondence. Ordinal description is a meta-technique which considers image measurements in terms of th...
Matthew Toews, William M. Wells III
FOCS
2000
IEEE
15 years 9 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
STACS
2000
Springer
15 years 8 months ago
Almost Complete Sets
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, S...
RECOMB
2007
Springer
16 years 4 months ago
Support Vector Training of Protein Alignment Models
Abstract. Sequence to structure alignment is an important step in homology modeling of protein structures. Incorporation of features like secondary structure, solvent accessibility...
Chun-Nam John Yu, Thorsten Joachims, Ron Elber, Ja...