130 search results - page 9 / 26 » Making Better Use of Global Discretization |
NIPS
2008
13 years 10 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
ICIP
1999
IEEE
14 years 27 days ago
1999
IEEE
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
JAC
2008
13 years 10 months ago
2008
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...