Sciweavers

4112 search results - page 212 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
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 11 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
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
15 years 8 months ago
Output-sensitive construction of the union of triangles
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)...
Eti Ezra, Micha Sharir
199
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...