862 search results - page 137 / 173 » Regularized Learning with Networks of Features |
112
click to vote
PLDI
2011
ACM
14 years 2 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
WWW
2008
ACM
16 years 14 days ago
2008
ACM
Because it is an integral part of the Internet routing apparatus, and because it allows multiple instances of the same service to be "naturally" discovered, IP Anycast h...
112
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
111
click to vote
PERCOM
2005
ACM
15 years 11 months ago
2005
ACM
Numerous schemes have been proposed for secure routing protocols, and Intrusion Detection and Response Systems, for ad hoc networks. In this paper, we present a proof-of-concept i...
116
click to vote
ICDAR
2011
IEEE
13 years 11 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...