Sciweavers

387 search results - page 50 / 78
» Towards in-place geometric algorithms and data structures
Sort
View
IPPS
1997
IEEE
15 years 4 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
SMI
2005
IEEE
15 years 6 months ago
Mesh Editing with an Embedded Network of Curves
We propose a new topological data structure for representing a set of polygonal curves embedded in a meshed surface. In this embedding, the vertices of the curve do not necessaril...
Wan-Chiu Li, Bruno Lévy, Jean-Claude Paul
FPGA
1999
ACM
174views FPGA» more  FPGA 1999»
15 years 4 months ago
Reduction of Latency and Resource Usage in Bit-Level Pipelined Data Paths for FPGAs
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...
Peter Kollig, Bashir M. Al-Hashimi
PAMI
2012
13 years 2 months ago
Exploring Context and Content Links in Social Media: A Latent Space Method
—Social media networks contain both content and context-specific information. Most existing methods work with either of the two for the purpose of multimedia mining and retrieva...
Guo-Jun Qi, Charu C. Aggarwal, Qi Tian, Heng Ji, T...
130
Voted
CISS
2007
IEEE
15 years 4 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami