32545 search results - page 566 / 6509 » Data Structures and Algorithms |
208
click to vote
ICCV
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
201
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Discovering causal relations among observed variables in a given data set is a main topic in studies of statistics and artificial intelligence. Recently, some techniques to disco...
196
click to vote
BNCOD
2004
15 years 8 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
217
click to vote
NIPS
1998
15 years 8 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
218
click to vote
AAAI
2008
15 years 9 months ago
2008
Matrix factorization algorithms are frequently used in the machine learning community to find low dimensional representations of data. We introduce a novel generative Bayesian pro...