Sciweavers

11211 search results - page 1979 / 2243
» Rank-Sensitive Data Structures
Sort
View
MM
2004
ACM
133views Multimedia» more  MM 2004»
15 years 9 months ago
Interactive retrieval of 3D shape models using physical objects
We present a novel method for interactive retrieval of 3D shapes using physical objects. Our method is based on simple physical 3D interaction with a set of tangible blocks. As th...
Hiroyasu Ichida, Yuichi Itoh, Yoshifumi Kitamura, ...
120
Voted
MM
2004
ACM
151views Multimedia» more  MM 2004»
15 years 9 months ago
Affinity relation discovery in image database clustering and content-based retrieval
In this paper, we propose a unified framework, called Markov Model Mediator (MMM), to facilitate image database clustering and to improve the query performance. The structure of t...
Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui ...
131
Voted
NETGAMES
2004
ACM
15 years 9 months ago
OpenPING: a reflective middleware for the construction of adaptive networked game applications
The emergence of distributed Virtual Reality (VR) applications that run over the Internet has presented networked game application designers with new challenges. In an environment...
Paul Okanda, Gordon S. Blair
105
Voted
NSPW
2004
ACM
15 years 9 months ago
The role of suspicion in model-based intrusion detection
We argue in favor of the explicit inclusion of suspicion as a concrete concept to be used in the analysis of audit data in order to guide the search for evidence of misuse. Our ap...
Timothy Hollebeek, Rand Waltzman
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
15 years 9 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
« Prev « First page 1979 / 2243 Last » Next »