Sciweavers

69 search results - page 5 / 14
» Near automorphisms of cycles
Sort
View
DM
2008
63views more  DM 2008»
13 years 10 months ago
Nomadic decompositions of bidirected complete graphs
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
Daniel W. Cranston
WACV
2005
IEEE
14 years 3 months ago
A Real-Time Rodent Tracking System for Both Light and Dark Cycle Behavior Analysis
Position tracking of rodents is useful and necessary to help elucidate the behavioral and physiological effects of genetic mutations, drug action, and environmental stimuli. In th...
Jane Brooks Zurn, Drew Hohmann, Steven I. Dworkin,...
ALGORITHMICA
2008
56views more  ALGORITHMICA 2008»
13 years 10 months ago
Eliminating Cycles in the Discrete Torus
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
Béla Bollobás, Guy Kindler, Imre Lea...
VTS
2007
IEEE
203views Hardware» more  VTS 2007»
14 years 4 months ago
Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code
Conventional error correcting code (ECC) schemes used in memories and caches cannot correct double bit errors caused by a single event upset (SEU). As memory density increases, mu...
Avijit Dutta, Nur A. Touba
IPPS
2005
IEEE
14 years 3 months ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu