Sciweavers

4212 search results - page 75 / 843
» On Compressible Pairings and Their Computation
Sort
View
113
Voted
ISCAPDCS
2003
15 years 2 months ago
N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces
Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using tr...
Aleksandar Milenkovic, Milena Milenkovic, Jeffrey ...
ICSE
2005
IEEE-ACM
16 years 21 days ago
A multiple case study on the impact of pair programming on product quality
Pair programming is a programming technique in which two programmers use one computer to work together on the same task. There is an ongoing debate over the value of pair programm...
Hanna Hulkko, Pekka Abrahamsson
NBIS
2009
Springer
15 years 7 months ago
Improving the Robustness of Wireless Device Pairing Using Hyphen-Delimited Numeric Comparison
Abstract—The operation of achieving authenticated key agreement between two human-operated mobile devices over a short range wireless communication channel, such as Bluetooth or ...
Ambarish Karole, Nitesh Saxena
118
Voted
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 1 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
ICALP
2003
Springer
15 years 5 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren