2104 search results - page 56 / 421 » Sorting with networks of data structures |
139
click to vote
UAI
1997
15 years 5 months ago
1997
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distribution...
136
click to vote
JACM
2000
15 years 3 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
145
Voted
UAI
1996
15 years 5 months ago
1996
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
136
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
154
Voted
TSP
2011
14 years 11 months ago
2011
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...