Sciweavers

1969 search results - page 36 / 394
» Financial Theory 1
Sort
View
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 8 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
BXML
2004
13 years 10 months ago
Subject Identification in Topic Maps in Theory and Practice
: If Topic Maps should be exchanged in distributed environments a common semantic problem occurs: Do two Topics refer to the same Subject? If they describe the same Subject the giv...
Lutz Maicher
CCA
2009
Springer
14 years 3 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler