10447 search results - page 1940 / 2090 » The Philosophy of Computer Science |
155
click to vote
ECIR
2009
Springer
16 years 3 months ago
2009
Springer
For bounded datasets such as the TREC Web Track (WT10g) the computation of term frequency (TF) and inverse document frequency (IDF) is not difficult. However, when the corpus is th...
160
click to vote
ICWS
2009
IEEE
16 years 3 months ago
2009
IEEE
Advances in the areas of embedded systems, computing, and networking are leading to an infrastructure composed of millions of heterogeneous devices. These devices will not simply ...
184
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
168
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
140
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...