Sciweavers

1135 search results - page 173 / 227
» Interactive Problem Solving via Algorithm Visualization
Sort
View
MM
2005
ACM
209views Multimedia» more  MM 2005»
15 years 8 months ago
Learning an image-word embedding for image auto-annotation on the nonlinear latent space
Latent Semantic Analysis (LSA) has shown encouraging performance for the problem of unsupervised image automatic annotation. LSA conducts annotation by keywords propagation on a l...
Wei Liu, Xiaoou Tang
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 4 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
ACMSE
2000
ACM
15 years 6 months ago
Exploring an information-based approach to computation and computational complexity
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
D. E. Stevenson
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
13 years 10 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
ECCV
2010
Springer
15 years 2 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof