Sciweavers

1591 search results - page 5 / 319
» Random lifts of graphs
Sort
View
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
15 years 2 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
ICIP
2003
IEEE
15 years 11 months ago
Context modeling and accessibility for 3D scalable compression
Highly scalable video compression based on invertible motion adaptive lifting transforms has emerged as a promising area in image processing research and an important component in...
Raymond Leung, David Taubman
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
14 years 11 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
JCT
2007
133views more  JCT 2007»
14 years 9 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
15 years 3 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera