Sciweavers

2800 search results - page 198 / 560
» Scaling RDF with time
Sort
View
COR
2008
101views more  COR 2008»
15 years 6 months ago
Stochastic facility location with general long-run costs and convex short-run costs
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
Peter Schütz, Leen Stougie, Asgeir Tomasgard
IJIS
2006
44views more  IJIS 2006»
15 years 6 months ago
Optimal choice of granularity in commonsense estimation: Why half-orders of magnitude?
It has been observed that when people make crude estimates, they feel comfortable choosing between alternatives which differ by a half-order of magnitude (e.g., were there 100, 30...
Jerry R. Hobbs, Vladik Kreinovich
TSP
2008
178views more  TSP 2008»
15 years 6 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
BC
2002
102views more  BC 2002»
15 years 6 months ago
Pathological tremors as diffusional processes
Two types of pathological tremors, essential and Parkinsonian, are studied using dynamical systems theory. It is shown that pathological tremors can be characterized as diffusional...
Jianbo Gao, Wen-wen Tung
CJ
2002
67views more  CJ 2002»
15 years 6 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...