Sciweavers

104 search results - page 12 / 21
» Adaptive Precision Setting for Cached Approximate Values
Sort
View
155
Voted
OOPSLA
2000
Springer
15 years 3 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
ISWC
2003
IEEE
15 years 5 months ago
Coarse, Inexpensive, Infrared Tracking for Wearable Computing
We present a novel, inexpensive, coarse tracking system that determines a person’s approximate 2D location and 1D head orientation in an indoor environment. While this coarse tr...
Drexel Hallaway, Tobias Höllerer, Steven Fein...
WWW
2008
ACM
16 years 28 days ago
A combinatorial allocation mechanism with penalties for banner advertising
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
16 years 14 days ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
120
Voted
WSC
2007
15 years 2 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...