Sciweavers

40 search results - page 5 / 8
» Efficient query processing on unstructured tetrahedral meshe...
Sort
View
COMCOM
2008
127views more  COMCOM 2008»
14 years 9 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
CIKM
2009
Springer
15 years 1 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
85
Voted
CGF
2010
148views more  CGF 2010»
14 years 9 months ago
Hardware-Assisted Projected Tetrahedra
We present a flexible and highly efficient hardware-assisted volume renderer grounded on the original Projected Tetrahedra (PT) algorithm. Unlike recent similar approaches, our me...
André Maximo, Ricardo Marroquim, Ricardo C....
CGF
1999
126views more  CGF 1999»
14 years 9 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
MMDB
2003
ACM
178views Multimedia» more  MMDB 2003»
15 years 2 months ago
Video query processing in the VDBMS testbed for video database research
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...
Walid G. Aref, Moustafa A. Hammad, Ann Christine C...