5105 search results - page 332 / 1021 » An algorithm to determine peer-reviewers |
165
click to vote
PDCAT
2007
Springer
16 years 27 days ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
189
click to vote
IIHMSP
2006
IEEE
16 years 25 days ago
2006
IEEE
— The frame-layer bit allocation problem for H.264 is studied in this work. We first impose a GOP (Group of Pictures) structure on the underlying H.264 video, and then develop a...
188
click to vote
CIKM
2005
Springer
16 years 10 days ago
2005
Springer
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
163
click to vote
FSTTCS
2005
Springer
16 years 9 days ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
165
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...