Sciweavers

621 search results - page 92 / 125
» Parsing As Tree Traversal
Sort
View
SDMW
2004
Springer
14 years 3 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
EUROPAR
2001
Springer
14 years 2 months ago
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
Abstract. When parallelizing hierarchical view frustum culling and collision detection, the low computation cost per node and the fact that the traversal path through the tree stru...
Ulf Assarsson, Per Stenström
PADS
1999
ACM
14 years 2 months ago
Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...
Xiao Zhonge, Brian Unger, Rob Simmonds, John G. Cl...
FCCM
2009
IEEE
123views VLSI» more  FCCM 2009»
14 years 1 months ago
Scalable High Throughput and Power Efficient IP-Lookup on FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
Hoang Le, Viktor K. Prasanna
ACIVS
2008
Springer
14 years 2 days ago
Efficient and Flexible Cluster-and-Search for CBIR
Content-Based Image Retrieval is a challenging problem both in terms of effectiveness and efficiency. In this paper, we present a flexible cluster-and-search approach that is able ...
Anderson Rocha, Jurandy Almeida, Mario A. Nascimen...