Sciweavers

1883 search results - page 240 / 377
» Ordered theta graphs
Sort
View
ISCA
2006
IEEE
158views Hardware» more  ISCA 2006»
14 years 3 months ago
Memory Model = Instruction Reordering + Store Atomicity
We present a novel framework for defining memory models in terms of two properties: thread-local Instruction Reordering axioms and Store Atomicity, which describes inter-thread c...
Arvind, Jan-Willem Maessen
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 3 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
INFOCOM
2005
IEEE
14 years 3 months ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
IPPS
2005
IEEE
14 years 3 months ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
14 years 3 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar