Sciweavers

3708 search results - page 146 / 742
» Approximating Betweenness Centrality
Sort
View
104
Voted
TCS
2002
15 years 13 days ago
Presentations of computably enumerable reals
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
Rodney G. Downey, Geoffrey LaForte
100
Voted
ISMIR
2005
Springer
139views Music» more  ISMIR 2005»
15 years 6 months ago
Classifier Combination for Capturing Musical Variation
At its heart, music information retrieval is characterized by the need to find the similarity between pieces of music. However, “similar” does not mean “the same”. Theref...
Jeremy Pickens
117
Voted
UAI
2004
15 years 2 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
JCO
2008
76views more  JCO 2008»
15 years 24 days ago
On the inapproximability of the exemplar conserved interval distance problem of genomes
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...
104
Voted
TCS
2008
15 years 21 days ago
Decidability and syntactic control of interference
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
James Laird