849 search results - page 138 / 170 » Completely Non-malleable Schemes |
118
Voted
VISSYM
2003
15 years 1 months ago
2003
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 ...
97
Voted
TRECVID
2007
15 years 1 months ago
2007
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...
100
Voted
DAWAK
2010
Springer
15 years 1 months ago
2010
Springer
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 ...
ICDE
2010
IEEE
15 years 20 days ago
2010
IEEE
: © 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...
93
Voted
AR
2007
15 years 18 days ago
2007
—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...