Sciweavers

344 search results - page 13 / 69
» The Directed Minimum Latency Problem
Sort
View
OSDI
2006
ACM
15 years 9 months ago
Operating System Profiling via Latency Analysis
Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavi...
Nikolai Joukov, Avishay Traeger, Rakesh Iyer, Char...
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
14 years 9 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
NIME
2001
Springer
126views Music» more  NIME 2001»
15 years 1 months ago
Problems and Prospects for Intimate Musical Control of Computers
In this paper we describe our efforts towards the development of live performance computer-based musical instrumentation. Our design criteria include initial ease of use coupled w...
David Wessel, Matthew Wright
DM
1998
57views more  DM 1998»
14 years 9 months ago
Note on alternating directed cycles
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
Gregory Gutin, Benny Sudakov, Anders Yeo
ISITA
2010
14 years 7 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...