2654 search results - page 130 / 531 » On Pairing Inversion Problems |
145
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
In the absence of a single module interface standard, integration of pre-designed modules in System-on-Chip design often requires the use of protocol converters. Existing approach...
106
click to vote
COGSCI
2010
15 years 5 months ago
2010
We created paired moral dilemmas with minimal contrasts in wording, a research strategy that has been advocated as a way to empirically establish principles operative in a domain-...
138
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
151
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
167
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...