Sciweavers

13271 search results - page 2606 / 2655
» Computers, Programming, and People
Sort
View
ISSTA
2000
ACM
15 years 4 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 4 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
HOTOS
1999
IEEE
15 years 4 months ago
The Case for Efficient File Access Pattern Modeling
Most modern I/O systems treat each file access independently. However, events in a computer system are driven by programs. Thus, accesses to files occur in consistent patterns and...
Tom M. Kroeger, Darrell D. E. Long
COLT
1999
Springer
15 years 4 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
RTAS
1999
IEEE
15 years 4 months ago
On Quality of Service Optimization with Discrete QoS Options
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
Chen Lee, John P. Lehoczky, Ragunathan Rajkumar, D...
« Prev « First page 2606 / 2655 Last » Next »