2877 search results - page 490 / 576 » The Complexity of Planarity Testing |
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
ESSMAC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
KBSE
2002
IEEE
14 years 3 months ago
2002
IEEE
ort gives their abstracts. s of the position papers Recent Experiences with Code Generation and Task Automation Agents in Software Tools (J. Grundy, J. Hosking) As software grows i...
LICS
2002
IEEE
14 years 3 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...