Sciweavers

230 search results - page 29 / 46
» A Linear Time Algorithm for L(2, 1)-Labeling of Trees
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICECCS
2007
IEEE
118views Hardware» more  ICECCS 2007»
14 years 3 months ago
Parallel Model Checking and the FMICS-jETI Platform
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
Jiri Barnat, Lubos Brim, Martin Leucker
ECCV
2002
Springer
14 years 11 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
CASES
2010
ACM
13 years 7 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 6 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig