Sciweavers

78 search results - page 14 / 16
» Linear Solvability in the Viewing Graph
Sort
View
ICML
2007
IEEE
14 years 7 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
14 years 4 days ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
COLT
2003
Springer
13 years 12 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
IDA
1999
Springer
13 years 11 months ago
3D Grand Tour for Multidimensional Data and Clusters
Grand tour is a method for viewing multidimensional data via linear projections onto a sequence of two dimensional subspaces and then moving continuously from one projection to the...
Li Yang
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 11 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani