Sciweavers

2432 search results - page 57 / 487
» Degrees and choice numbers
Sort
View
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
15 years 8 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
JNS
2008
55views more  JNS 2008»
15 years 1 months ago
Interaction of Two Charges in a Uniform Magnetic Field: II. Spatial Problem
The interaction of two charges moving in R3 in a magnetic field B can be formulated as a Hamiltonian system with six degrees of freedom. Assuming that the magnetic field is uniform...
D. Pinheiro, R. S. MacKay
ICDAR
2009
IEEE
14 years 11 months ago
Invariant Primitives for Handwritten Arabic Script: A Contrastive Study of Four Feature Sets
The choice of relevant features is very decisive in handwriting recognition rate. Our aim is to present some useful structural and statistical features and see their degree of var...
Sofiene Haboubi, Samia Maddouri, Noureddine Ellouz...
LOGCOM
2007
72views more  LOGCOM 2007»
15 years 1 months ago
Post's Programme for the Ershov Hierarchy
This paper extends Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets. Our initial characterisation, in the spirit of Post [27], of the degrees of the immune...
Bahareh Afshari, George Barmpalias, S. Barry Coope...
FOCS
2002
IEEE
15 years 7 months ago
Load Balancing with Memory
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
Michael Mitzenmacher, Balaji Prabhakar, Devavrat S...