Sciweavers

3415 search results - page 313 / 683
» Lower bounds on kernelization
Sort
View
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
16 years 4 months ago
On Randomness Measures for Social Networks.
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
Xiaowei Ying, Xintao Wu
DATE
2009
IEEE
101views Hardware» more  DATE 2009»
16 years 1 months ago
Flow regulation for on-chip communication
Abstract—We propose (σ, ρ)-based flow regulation as a design instrument for System-on-Chip (SoC) architects to control quality-of-service and achieve cost-effective communicat...
Zhonghai Lu, Mikael Millberg, Axel Jantsch, Alista...
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
16 years 1 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
COST
2009
Springer
95views Multimedia» more  COST 2009»
16 years 1 months ago
A Matching Algorithm Secure against the Wolf Attack in Biometric Authentication Systems
We propose a matching algorithm secure against the wolf attack in one-to-one biometric authentications. Our proposal algorithm first executes a one-to-all comparison using a conve...
Yoshihiro Kojima, Rie Shigetomi, Manabu Inuma, Aki...
ISAAC
2009
Springer
130views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Counting in the Presence of Memory Faults
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
Gerth Stølting Brodal, Allan Grønlun...