Sciweavers

84 search results - page 6 / 17
» Asymptotic enumeration of orientations
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Asymptotically optimal transmission policies for low-power wireless sensor networks
— We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joi...
Ioannis Ch. Paschalidis, Wei Lai, David Starobinsk...
CCCG
2001
13 years 9 months ago
Complete combinatorial generation of small point configurations and hyperplane arrangements
A recent progress on the complete enumeration of oriented matroids enables us to generate all combinatorial types of small point configurations and hyperplane arrangements in gene...
Lukas Finschi, Komei Fukuda
DCG
2000
79views more  DCG 2000»
13 years 7 months ago
Mutation Polynomials and Oriented Matroids
Several polynomials are of use in various enumeration problems concerning objects in oriented matroids. Chief among these is the Radon catalog. We continue to study these, as well ...
J. Lawrence
JCT
2006
100views more  JCT 2006»
13 years 8 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 1 months ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao