415 search results - page 63 / 83 » Optimal query complexity bounds for finding graphs |
UAI
2004
13 years 9 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
JACM
2000
13 years 7 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...
ISCC
2008
IEEE
14 years 2 months ago
2008
IEEE
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...