Sciweavers

1209 search results - page 104 / 242
» Approximation by pseudo-linear operators
Sort
View
122
Voted
PODC
2009
ACM
16 years 5 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor
POPL
2007
ACM
16 years 4 months ago
Specialization of CML message-passing primitives
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...
John H. Reppy, Yingqi Xiao
120
Voted
IWMM
2007
Springer
110views Hardware» more  IWMM 2007»
15 years 10 months ago
Path: page access tracking to improve memory management
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. ...
Reza Azimi, Livio Soares, Michael Stumm, Thomas Wa...
131
Voted
JSAC
2011
83views more  JSAC 2011»
14 years 7 months ago
Trading Rate for Balanced Queue Lengths for Network Delay Minimization
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...
Jing Yang, Sennur Ulukus
CVPR
2004
IEEE
16 years 6 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...