1421 search results - page 194 / 285 » Algorithms for subsequence combinatorics |
125
Voted
ELPUB
2008
ACM
15 years 6 months ago
2008
ACM
This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into ac...
155
Voted
FPGA
2008
ACM
15 years 5 months ago
2008
ACM
We present an in-depth analysis of the Xilinx bitstream format. The information gathered in this paper allows bitstream compilation and decompilation. While not actually compromis...
147
click to vote
ACID
2006
15 years 5 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
134
click to vote
DMIN
2006
15 years 5 months ago
2006
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
141
click to vote
FLAIRS
2004
15 years 5 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...