Sciweavers

8669 search results - page 333 / 1734
» Computing matrix representations
Sort
View
KER
2007
90views more  KER 2007»
15 years 6 months ago
Ontology-based models in pervasive computing systems
Pervasive computing is by its nature open and extensible, and must integrate the information from a diverse range of sources. This leads to a problem of information exchange, so s...
Juan Ye, Lorcan Coyle, Simon Dobson, Paddy Nixon
DCC
2005
IEEE
16 years 6 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
ARITH
1999
IEEE
15 years 11 months ago
Digit-Recurrence Algorithm for Computing Euclidean Norm of a 3-D Vector
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
Naofumi Takagi, Seiji Kuwahara
UAI
2004
15 years 8 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...