Sciweavers

1060 search results - page 46 / 212
» On the Discovery of Random Trees
Sort
View
JOBIM
2000
15 years 1 months ago
Can We Have Confidence in a Tree Representation?
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
Alain Guénoche, Henri Garreta
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
15 years 11 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
AINA
2006
IEEE
14 years 12 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
Haibo Zhang, Hong Shen
IJCAI
2007
14 years 11 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
ICASSP
2011
IEEE
14 years 1 months ago
Automatic minute generation for parliamentary speech using conditional random fields
We show a novel approach of automatically generating minutes style extractive summaries for parliamentary speech. Minutes are structured summaries consisting of sequences of busin...
Justin Jian Zhang, Pascale Fung, Ricky Ho Yin Chan