Sciweavers

2950 search results - page 321 / 590
» Computing with Infinitely Many Processes
Sort
View
ICMCS
2005
IEEE
85views Multimedia» more  ICMCS 2005»
16 years 7 days ago
Fast Search Method for Image Vector Quantization Based on Equal-Average Equal-Variance and Partial Sum Concept
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...
Zhibin Pan, Koji Kotani, Tadahiro Ohmi
SC
2005
ACM
16 years 5 days ago
Identity Boxing: A New Technique for Consistent Global Identity
Today, users of the grid may easily authenticate themselves to computing resources around the world using a public key security infrastructure. However, users are forced to employ...
Douglas Thain
IUI
2003
ACM
15 years 12 months ago
An experiment in automated humorous output production
Computational humor will be needed in interfaces, no less than other cognitive capabilities. There are many practical settings where computational humor will add value. Among them...
Oliviero Stock, Carlo Strapparava
SIGGRAPH
1998
ACM
15 years 11 months ago
Multiple-center-of-projection Images
In image-based rendering, images acquired from a scene are used to represent the scene itself. A number of reference images are required to fully represent even the simplest scene...
Paul Rademacher, Gary Bishop
GI
1998
Springer
15 years 11 months ago
An Efficient Strategy for Tiling Multidimensional OLAP Data Cubes
Computing aggregates over selected categories of multidimensional discrete data (MDD) cubes is the core operation of many on-line analytical processing (OLAP) systems. In order to...
Paolo Marques, Paula Furtado, Peter Baumann