495 search results - page 90 / 99 » Data exchange: computing cores in polynomial time |
PPOPP
2010
ACM
13 years 7 months ago
2010
ACM
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
FLAIRS
2008
13 years 11 months ago
2008
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
SECON
2010
IEEE
13 years 6 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...