Sciweavers

5055 search results - page 691 / 1011
» Relative Timing
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
ICSM
2002
IEEE
15 years 11 months ago
Maintaining Software with a Security Perspective
Testing for software security is a lengthy, complex and costly process. Currently, security testing is done using penetration analysis and formal verification of security kernels....
Kanta Jiwnani, Marvin V. Zelkowitz
IEEEMSP
2002
IEEE
117views Multimedia» more  IEEEMSP 2002»
15 years 11 months ago
Hidden Markov model for automatic transcription of MIDI signals
— This paper describes a Hidden Markov Model (HMM)-based method of automatic transcription of MIDI (Musical Instrument Digital Interface) signals of performed music. The problem ...
Haruto Takeda, Naoki Saito, Tomoshi Otsuki, Mitsur...
IEEEPACT
2002
IEEE
15 years 11 months ago
Using the Compiler to Improve Cache Replacement Decisions
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosen...
INFOCOM
2002
IEEE
15 years 11 months ago
Constraint-based path selection methods for on-demand provisioning in WDM networks
Abstract-- We propose a framework for decentralized path selection and on-demand wavelength channel provisioning in WDM networks with routing constraints. Within this framework, th...
Admela Jukan, Gerald Franzl