1518 search results - page 83 / 304 » Exact and Approximate Bandwidth |
136
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
188
click to vote
AI
2011
Springer
14 years 8 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
149
click to vote
FOCM
2011
14 years 7 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
123
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
220
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...