Sciweavers

164 search results - page 24 / 33
» Sequential update of ADtrees
Sort
View
UC
2005
Springer
14 years 1 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
VLDB
2001
ACM
149views Database» more  VLDB 2001»
14 years 25 days ago
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
Recent research addressed the importance of optimizing L2 cache utilization in the design of main memory indexes and proposed the so-called cache-conscious indexes such as the CSB...
Sang Kyun Cha, Sangyong Hwang, Kihong Kim, Keunjoo...
TIT
2008
121views more  TIT 2008»
13 years 8 months ago
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
ICS
1999
Tsinghua U.
14 years 20 days ago
Eliminating synchronization bottlenecks in object-based programs using adaptive replication
This paper presents a technique, adaptive replication, for automatically eliminating synchronization bottlenecks in multithreaded programs that perform atomic operations on object...
Martin C. Rinard, Pedro C. Diniz
CVPR
2008
IEEE
14 years 10 months ago
Least squares congealing for unsupervised alignment of images
In this paper, we present an approach we refer to as "least squares congealing" which provides a solution to the problem of aligning an ensemble of images in an unsuperv...
Mark Cox, Sridha Sridharan, Simon Lucey, Jeffrey F...