1101 search results - page 167 / 221 » An Algorithm for the Graph Crossing Number Problem |
114
click to vote
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
122
click to vote
WG
2010
Springer
15 years 10 days ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
110
click to vote
DAC
1995
ACM
15 years 5 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
121
click to vote
CAV
2008
Springer
15 years 4 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
105
click to vote
UAI
2004
15 years 3 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...