Sciweavers

620 search results - page 66 / 124
» The edge-flipping group of a graph
Sort
View
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 8 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
CVPR
2004
IEEE
14 years 11 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
14 years 2 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 9 months ago
Co-evolution of social and affiliation networks
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
Elena Zheleva, Hossam Sharara, Lise Getoor
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 8 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko