Sciweavers

4114 search results - page 225 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
AAAI
2006
15 years 8 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
15 years 6 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
CG
2008
Springer
15 years 6 months ago
Efficient image reconstruction for point-based and line-based rendering
We address the problem of an efficient image-space reconstruction of adaptively sampled scenes in the context of point-based and line-based graphics. The imagespace reconstruction...
Ricardo Marroquim, Martin Kraus, Paulo Roma Cavalc...
ACSAC
2007
IEEE
15 years 10 months ago
Efficient Detection of Delay-Constrained Relay Nodes
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
Baris Coskun, Nasir D. Memon
IPPS
1999
IEEE
15 years 10 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton