2200 search results - page 115 / 440 » Bloch's Constant is Computable |
184
click to vote
BXML
2003
15 years 7 months ago
2003
: A large variety of emerging Computational Grid applications require versioning services to support effective management of constantly changing datasets and implementations of dat...
170
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
d Abstract) Bertrand Ducourthial Sofiane Khalfallah Franck Petit We propose a group membership service for asynchronous wireless dynamic ad hoc networks. It maintains as long as p...
150
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...
160
click to vote
ECCC
2006
15 years 6 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
147
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...