Sciweavers

431 search results - page 23 / 87
» Implementing the maximum of monotone algorithms
Sort
View
SPAA
2009
ACM
15 years 10 months ago
A lightweight in-place implementation for software thread-level speculation
Thread-level speculation (TLS) is a technique that allows parts of a sequential program to be executed in parallel. TLS ensures the parallel program's behaviour remains true ...
Cosmin E. Oancea, Alan Mycroft, Tim Harris
ICIP
2007
IEEE
15 years 4 months ago
Early Termination Algorithms for Correlation Coefficient Based Block Matching
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
Arif Mahmood, Sohaib Khan
WSC
2004
14 years 11 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
GLOBECOM
2008
IEEE
15 years 4 months ago
Throughput Analysis of Randomized Sleep Scheduling with Constrained Connectivity in Wireless Sensor Networks
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...
Youngsang Kim, Changwoo Yang, Chun-Hung Liu