Sciweavers

279 search results - page 30 / 56
» Typability in Partial Applicative Structures
Sort
View
MONET
2007
110views more  MONET 2007»
14 years 11 months ago
Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
Stephen S. Yau, Wei Gao
RSA
2010
104views more  RSA 2010»
14 years 10 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 6 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
95
Voted
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 6 months ago
Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information
The characterization of a binary function by partial frequency information is considered. We show that it is possible to reconstruct the binary signal from incomplete frequency me...
Yu Mao
SCALESPACE
2009
Springer
15 years 6 months ago
PDE-Driven Adaptive Morphology for Matrix Fields
Matrix fields are important in many applications since they are the adequate means to describe anisotropic behaviour in image processing models and physical measurements. A promin...
Bernhard Burgeth, Michael Breuß, Luis Pizarr...