Sciweavers

933 search results - page 57 / 187
» Monotone Complexity of a Pair
Sort
View
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
15 years 11 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 10 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
149
Voted
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
15 years 10 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
16 years 21 days ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
16 years 20 days ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich