Sciweavers

4913 search results - page 134 / 983
» Results and Perspectives of the G
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 8 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
SCN
2008
Springer
126views Communications» more  SCN 2008»
13 years 10 months ago
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
We consider the task of computing power productsQ 1ik gei i ("multi-exponentiation") where base elements g2, . . ., gk are fixed while g1 is variable between multi-expone...
Bodo Möller, Andy Rupp
CPC
2010
117views more  CPC 2010»
13 years 8 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
ICDAR
2009
IEEE
13 years 8 months ago
Coupled Snakelet Model for Curled Textline Segmentation of Camera-Captured Document Images
Detection of curled textline is important for dewarping of hand-held camera-captured document images. Then baselines and the lines following the top of x-height of characters (x-l...
Syed Saqib Bukhari, Faisal Shafait, Thomas M. Breu...
IJKL
2010
105views more  IJKL 2010»
13 years 5 months ago
Lurking: a challenge or a fruitful strategy? A comparison between lurkers and active participants in an online corporate communi
: For todays organisations to obtain competitive advantages, online corporate Communities of Practice (CoPs) are indispensable. However, often the majority of its participants does...
Mirjam Neelen, Sibren Fetter