Sciweavers

1732 search results - page 12 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
77
Voted
ARSCOM
2008
118views more  ARSCOM 2008»
14 years 9 months ago
Proper Partitions of a Polygon and k-Catalan Numbers
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1, 2, . . . , c. Motivated by conjectures of Propp, we are led to consider partitions of ...
Bruce E. Sagan
ICPR
2008
IEEE
15 years 10 months ago
Efficient triangulation based on 3D Euclidean optimization
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
Klas Nordberg
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
15 years 2 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
14 years 7 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
90
Voted
WAIFI
2007
Springer
175views Mathematics» more  WAIFI 2007»
15 years 3 months ago
Attacking the Filter Generator over GF (2 m )
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
Sondre Rønjom, Tor Helleseth