Sciweavers

8669 search results - page 135 / 1734
» Computing matrix representations
Sort
View
WSC
2007
13 years 11 months ago
Optimistic parallel discrete event simulation of the event-based transmission line matrix method
In this paper we describe a technique for efficient parallelization of digital wave guide network (DWN) models based on an interpretation of the finite difference time domain (F...
David W. Bauer, Ernest H. Page
MST
2010
121views more  MST 2010»
13 years 7 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna
CORR
2011
Springer
157views Education» more  CORR 2011»
13 years 4 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
SIGIR
2005
ACM
14 years 2 months ago
SimFusion: measuring similarity using unified relationship matrix
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
Wensi Xi, Edward A. Fox, Weiguo Fan, Benyu Zhang, ...
FTDCS
2004
IEEE
14 years 27 days ago
The vMatrix: Server Switching
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
Amr Awadallah, Mendel Rosenblum