3600 search results - page 563 / 720 » The settling-time reducibility ordering |
169
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
215
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper we present a model for the carpet cutting problem in which carpet shapes are cut from a rectangular carpet roll with a fixed width and sufficiently long le...
222
click to vote
ECBS
2011
IEEE
14 years 6 months ago
2011
IEEE
—Developing dependable distributed real-time and embedded (DRE) systems incurs significant complexities in the tradeoffs resulting from the different conflicting attributes of ...
200
click to vote
IACR
2011
14 years 6 months ago
2011
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...
161
click to vote
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—In order to reduce the long runtimes required to simulate hybrid automatic repeat-request (ARQ) systems, such as high-speed downlink packet access (HSDPA), we propose an informa...