Sciweavers

3545 search results - page 47 / 709
» Computational methods for case-cohort studies
Sort
View
JPDC
2006
106views more  JPDC 2006»
15 years 6 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
FORMATS
2010
Springer
15 years 4 months ago
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
Patricia Bouyer, Romain Brenguier, Nicolas Markey
GROUP
2010
ACM
15 years 4 months ago
Design methods as discourse on practice
In this paper, we present a view of design methods as discourse on practice. We consider how the deployment of a particular set of design methods enables and constrains not only p...
Marisa Leavitt Cohn, Susan Elliott Sim, Paul Douri...
MICCAI
2005
Springer
16 years 7 months ago
A Physical Model for DT-MRI Based Connectivity Map Computation
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Burak Acar, Erdem Yörük, Roland Bammer
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 10 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas