85 search results - page 6 / 17 » Scaling limit of random k-trees |
167
click to vote
DKE
2002
15 years 6 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
179
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Generative topic models such as LDA are limited by their inability to utilize nontrivial input features to enhance their performance, and many topic models assume that topic assig...
161
click to vote
WOWMOM
2005
ACM
16 years 14 hour ago
2005
ACM
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
237
click to vote
AAAI
2011
14 years 6 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
204
click to vote
IDA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...