Sciweavers

1884 search results - page 255 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
16 years 26 days ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
COLT
2003
Springer
16 years 21 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
HUC
2003
Springer
16 years 20 days ago
RightSPOT: A Novel Sense of Location for a Smart Personal Object
Abstract. One of the main prerequisites for location-based services is knowledge of location. We present a simple algorithm for computing the location of a device based on signal s...
John Krumm, Gerry Cermak, Eric Horvitz
IEEEPACT
2002
IEEE
16 years 12 days ago
Using the Compiler to Improve Cache Replacement Decisions
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosen...
224
Voted
ISVC
2009
Springer
16 years 1 days ago
Layered Volume Splatting
We present a new layered, hardware-accelerated splatting algorithm for volume rendering. Layered volume splatting features the speed benefits of fast axis-aligned pre-classified ...
Philipp Schlegel, Renato Pajarola