Sciweavers

325 search results - page 48 / 65
» Computing all skyline probabilities for uncertain data
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller
CVPR
2011
IEEE
13 years 2 months ago
Learning structured prediction models for interactive image labeling
We propose structured models for image labeling that take into account the dependencies among the image labels explicitly. These models are more expressive than independent label ...
Thomas Mensink, Jakob Verbeek, Gabriela Csurka
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SAC
2009
ACM
14 years 2 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad