2069 search results - page 275 / 414 » Linear time algorithms for Clobber |
151
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
Consider the permutation S in RC4. Roos pointed out in 1995 that after the Key Scheduling Algorithm (KSA) of RC4, each of the initial bytes of the permutation, i.e., S[y] for smal...
151
click to vote
DCG
2008
15 years 6 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
163
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
177
click to vote
TCS
2008
15 years 6 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
191
click to vote
ANNPR
2008
Springer
15 years 8 months ago
2008
Springer
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...