12697 search results - page 2217 / 2540 » Call for Papers |
126
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
146
click to vote
MPC
2010
Springer
15 years 9 months ago
2010
Springer
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
171
click to vote
CF
2007
ACM
15 years 8 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
147
click to vote
GIS
2009
ACM
15 years 8 months ago
2009
ACM
Raster maps are widely available and contain useful geographic features such as labels and road lines. To extract the geographic features, most research work relies on a manual st...
131
Voted
DAGSTUHL
2007
15 years 6 months ago
2007
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...