Sciweavers

653 search results - page 47 / 131
» The size of minimum 3-trees
Sort
View
PVLDB
2010
112views more  PVLDB 2010»
14 years 10 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
TCOM
2010
130views more  TCOM 2010»
14 years 10 months ago
On modeling, analysis, and optimization of packet aggregation systems
Abstract—In packet communication systems, a header is attached to the transmitted packet at each layer. The overhead due to the transmission of the individual header can have a s...
Jung Ha Hong, Khosrow Sohraby
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
14 years 10 months ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
CORR
2010
Springer
75views Education» more  CORR 2010»
14 years 10 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi
EMSOFT
2010
Springer
14 years 9 months ago
Optimal WCET-aware code selection for scratchpad memory
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
Hui Wu, Jingling Xue, Sridevan Parameswaran