Sciweavers

110 search results - page 17 / 22
» Spectral Graph Theory and its Applications
Sort
View
ISPDC
2008
IEEE
14 years 1 months ago
FPGA Implementations of a Parallel Associative Processor with Multi-Comparand Multi-Search Operations
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
Zbigniew Kokosinski, Bartlomiej Malus
JCT
1998
193views more  JCT 1998»
13 years 7 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
PRL
2007
108views more  PRL 2007»
13 years 7 months ago
Towards a measure of deformability of shape sequences
In this paper we develop a theory for characterizing how deformable a shape is given a sequence of its observations. We define a term called ‘‘deformability index’’ (DI) ...
Amit K. Roy Chowdhury
WWW
2005
ACM
14 years 8 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
SPAA
2005
ACM
14 years 1 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi