2430 search results - page 433 / 486 » Computing Tutte Polynomials |
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
SPAA
2006
ACM
14 years 4 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
SASN
2005
ACM
14 years 3 months ago
2005
ACM
Group communication has become an important component in wireless networks. In this paper, we focus on the environments in which multiple groups coexist in the system, and both in...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...