4850 search results - page 187 / 970 » Approximate Data Structures with Applications |
213
Voted
JMLR
2010
15 years 1 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
294
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
139
Voted
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
169
click to vote
TSP
2010
15 years 29 days ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
180
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
Highly distributed systems such as Grids are used today to the execution of large-scale parallel applications. The behavior analysis of these applications is not trivial. The comp...