3505 search results - page 672 / 701 » Information Theory and the IrisCode |
CTCS
1989
Springer
15 years 1 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
105
click to vote
ATAL
2007
Springer
15 years 1 months ago
2007
Springer
Integrating contributions received from other agents is an essential activity in multi-agent systems (MASs). Not only must related contributions be integrated together, but the co...
CASES
2007
ACM
15 years 1 months ago
2007
ACM
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
116
click to vote
DIALM
2007
ACM
15 years 1 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...