2107 search results - page 128 / 422 » Computing Small Search Numbers in Linear Time |
120
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
129
click to vote
ICDCSW
2002
IEEE
15 years 8 months ago
2002
IEEE
Time-driven Key Sequencing (TKS) is a key management technique that synchronizes the session key used by a set of communicating principals based on time of day. This relatively lo...
136
Voted
IR
2008
15 years 3 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
148
Voted
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
133
Voted
PERCOM
2003
ACM
16 years 3 months ago
2003
ACM
Time information is critical for a variety of applications in distributed environments that facilitate pervasive computing and communication. This work describes and evaluates a no...