1732 search results - page 164 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
121
click to vote
IEEESP
2008
15 years 6 months ago
2008
hardware, eliminating an abstraction layer and often improving efficiency as a result. Examples of type 1 systems include VMware ESX,3 Xen (www. xensource.com/xen/xen/nfamily/virtu...
165
click to vote
MICCAI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper, we propose a robust fully non-supervised method dedicated to the segmentation of the brain in T1-weighted MR images. The first step consists in the analysi...
174
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
190
click to vote
SAGT
2009
Springer
15 years 11 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
141
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...