1201 search results - page 110 / 241 » Linear Probing and Graphs |
104
Voted
ISAAC
1992
Springer
15 years 4 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
101
click to vote
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
118
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
114
Voted
CATS
2008
15 years 2 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
89
Voted
UAI
2004
15 years 2 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...