4110 search results - page 154 / 822 » Efficient algorithms for the 2-gathering problem |
131
click to vote
CG
2008
Springer
15 years 4 months ago
2008
Springer
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...
162
click to vote
ACSAC
2007
IEEE
15 years 8 months ago
2007
IEEE
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...
130
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
146
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
147
Voted
ICTAI
2000
IEEE
15 years 8 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...