Sciweavers

849 search results - page 138 / 170
» Completely Non-malleable Schemes
Sort
View
VISSYM
2003
13 years 10 months ago
Hardware-assisted View-dependent Isosurface Extraction using Spherical Partition
Extracting only the visible portion of an isosurface can improve both the computation efficiency and the rendering speed. However, the visibility test overhead can be quite high ...
Jinzhu Gao, Han-Wei Shen
TRECVID
2007
13 years 10 months ago
ENST/UOB/LU@TRECVID2007 HIGH LEVEL FEATURE EXTRACTION USING 2-LEVEL PIECEWISE GMM
We describe a high level feature extraction system for video. Video sequences are modeled using Gaussian Mixture Models. We have used those models in the past to segment video seq...
George Yazbek, Georges Kfoury, Gabriel Alam, Chafi...
DAWAK
2010
Springer
13 years 10 months ago
Frequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
Chuntao Jiang, Frans Coenen, Michele Zito
ICDE
2010
IEEE
180views Database» more  ICDE 2010»
13 years 9 months ago
Adaptive indexing for relational keys
: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking A...
Goetz Graefe, Harumi A. Kuno
AR
2007
105views more  AR 2007»
13 years 9 months ago
Reinforcement learning of a continuous motor sequence with hidden states
—Reinforcement learning is the scheme for unsupervised learning in which robots are expected to acquire behavior skills through self-explorations based on reward signals. There a...
Hiroaki Arie, Tetsuya Ogata, Jun Tani, Shigeki Sug...