1520 search results - page 272 / 304 » Class Hierarchy Specialization |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...
IACR
2011
12 years 7 months ago
2011
Abstract. The Gallant-Lambert-Vanstone (GLV) method is a very ef cient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. G...
ICDE
2012
IEEE
12 years 7 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...