2430 search results - page 271 / 486 » Computing Tutte Polynomials |
120
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
92
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
141
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
121
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
123
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....