Sciweavers

4926 search results - page 370 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View

Lecture Notes
742views
17 years 2 months ago
Computer Systems Analysis
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
Raj Jain
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
15 years 10 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 10 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
ICCV
2011
IEEE
14 years 4 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille