Sciweavers

958 search results - page 77 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
ICPR
2002
IEEE
15 years 3 months ago
A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
Guangming Li, Jie Tian, Mingchang Zhao, Huiguang H...
FCSC
2007
131views more  FCSC 2007»
14 years 10 months ago
SONNET: subscription using path queries over structured overlay networks
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
Weining Qian, Linhao Xu, Aoying Zhou, Minqi Zhou
CGI
2003
IEEE
15 years 1 months ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
76
Voted
VLDB
1990
ACM
106views Database» more  VLDB 1990»
15 years 2 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
ICML
2006
IEEE
15 years 6 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford