Sciweavers

1486 search results - page 262 / 298
» Algorithms for two-box covering
Sort
View
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 8 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
PERCOM
2007
ACM
14 years 8 months ago
Achieving Flexible Cache Consistency for Pervasive Internet Access
Caching is an important technique to support pervasive Internet access. Cache consistency measures the deviation between the cached data and the source data. In mobile computing e...
Yu Huang 0002, Jiannong Cao, Zhijun Wang, Beihong ...
WINE
2009
Springer
93views Economy» more  WINE 2009»
14 years 3 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 2 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
SRDS
2006
IEEE
14 years 2 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring