973 search results - page 66 / 195 » New Bounds on Crossing Numbers |
179
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
176
click to vote
NJC
2000
15 years 6 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
200
click to vote
JSSPP
2007
Springer
16 years 9 days ago
2007
Springer
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
158
click to vote
COLT
2007
Springer
16 years 10 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
140
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...