Sciweavers

2621 search results - page 356 / 525
» Near orders and codes
Sort
View
DCC
2009
IEEE
16 years 7 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Ge Nong, Sen Zhang, Wai Hong Chan
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
16 years 6 months ago
Data integration in mashups
Mashup is a new application development approach that allows users to aggregate multiple services to create a service for a new purpose. Even if the Mashup approach opens new and ...
Giusy Di Lorenzo, Hakim Hacid, Hye-Young Paik, Bou...
MOBISYS
2003
ACM
16 years 6 months ago
Full TCP/IP for 8-Bit Architectures
We describe two small and portable TCP/IP implementations fulfilling the subset of RFC1122 requirements needed for full host-to-host interoperability. Our TCP/IP implementations d...
Adam Dunkels
PPOPP
2010
ACM
16 years 3 months ago
Modeling transactional memory workload performance
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
Donald E. Porter, Emmett Witchel
ICCAD
2001
IEEE
128views Hardware» more  ICCAD 2001»
16 years 3 months ago
An Assembly-Level Execution-Time Model for Pipelined Architectures
The aim of this work is to provide an elegant and accurate static execution timing model for 32-bit microprocessor instruction sets, covering also inter–instruction effects. Suc...
Giovanni Beltrame, Carlo Brandolese, William Forna...