Sciweavers

1301 search results - page 176 / 261
» Bounded Version Vectors
Sort
View
CGO
2008
IEEE
14 years 4 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
COMPGEOM
2003
ACM
14 years 3 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 10 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 10 months ago
Optimal Scheduling of Peer-to-Peer File Dissemination
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Intern...
Jochen Mundinger, Richard R. Weber, Gideon Weiss
LATINCRYPT
2010
13 years 8 months ago
Cryptanalysis of the Hidden Matrix Cryptosystem
Abstract. In this paper, we present an efficient cryptanalysis of the socalled HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, ...
Jean-Charles Faugère, Antoine Joux, Ludovic...