Sciweavers

4698 search results - page 121 / 940
» Making Functionality More General
Sort
View
105
Voted
JSYML
2010
62views more  JSYML 2010»
15 years 1 months ago
A monotonicity theorem for dp-minimal densely ordered groups
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal den...
John Goodrick
IJHPCN
2006
106views more  IJHPCN 2006»
15 years 3 months ago
Hash chains with diminishing ranges for sensors
Sensors and other small devices that periodically transmit relatively small packets of information motivate the study of hash chains with small domains and ranges. Hash chain based...
Phillip G. Bradford, Olga V. Gavrylyako
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
15 years 3 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
ICFP
2000
ACM
15 years 7 months ago
Functional programming in C++
This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymo...
Brian McNamara, Yannis Smaragdakis
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 4 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin