Sciweavers

443 search results - page 20 / 89
» More on the Size of Higman-Haines Sets: Effective Constructi...
Sort
View
INFOVIS
2002
IEEE
14 years 14 days ago
Beamtrees: Compact Visualization of Large Hierarchies
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
Frank van Ham, Jarke J. van Wijk
BMCBI
2010
74views more  BMCBI 2010»
13 years 7 months ago
Correcting for the effects of natural abundance in stable isotope resolved metabolomics experiments involving ultra-high resolut
Background: Stable isotope tracing with ultra-high resolution Fourier transform-ion cyclotron resonance-mass spectrometry (FT-ICR-MS) can provide simultaneous determination of hun...
Hunter N. B. Moseley
DCC
2006
IEEE
14 years 7 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 7 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
GRC
2005
IEEE
14 years 1 months ago
Discovering and ranking important rules
— Decision rules generated from reducts can fully describe a data set. We introduce a new method of evaluating rules by taking advantage of rough sets theory. We consider rules g...
Jiye Li, Nick Cercone