1629 search results - page 51 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
COLT
2006
Springer
15 years 1 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...
FLAIRS
2004
14 years 11 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
ESA
2007
Springer
15 years 1 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
156
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper explores the aggregate effect when caching multiple versions of the same Web object in the transcoding proxy. Explicitly, the aggregate profit from caching multiple ver...
ICMCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...