1291 search results - page 92 / 259 » Computing the multiplicity structure in solving polynomial s... |
120
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
104
Voted
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
134
Voted
RECOMB
2002
Springer
16 years 2 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
116
Voted
VIZSEC
2005
Springer
15 years 7 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
114
click to vote
AAAI
1996
15 years 3 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...