Sciweavers

33 search results - page 5 / 7
» Multiply-intersecting families revisited
Sort
View
IACR
2011
139views more  IACR 2011»
12 years 7 months ago
Improved Meet-in-the-Middle Cryptanalysis of KTANTAN
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
Lei Wei, Christian Rechberger, Jian Guo 0001, Hong...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 8 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
DOCENG
2010
ACM
13 years 7 months ago
Next generation typeface representations: revisiting parametric fonts
Outline font technology has long been established as the standard way to represent typefaces, allowing characters to be represented independently of print size and resolution. Alt...
Tamir Hassan, Changyuan Hu, Roger D. Hersch
RECOMB
2003
Springer
14 years 7 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
COMPGEOM
2010
ACM
14 years 16 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...