Sciweavers

2913 search results - page 472 / 583
» How Much to Copy
Sort
View
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
11 years 11 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
INFOCOM
2012
IEEE
11 years 11 months ago
A theory of cloud bandwidth pricing for video-on-demand providers
—Current-generation cloud computing is offered with usage-based pricing, with no bandwidth capacity guarantees, which is however unappealing to bandwidth-intensive applications s...
Di Niu, Chen Feng, Baochun Li
CVPR
2012
IEEE
11 years 11 months ago
Active image clustering: Seeking constraints from humans to complement algorithms
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
Arijit Biswas, David W. Jacobs
DAC
2012
ACM
11 years 11 months ago
On software design for stochastic processors
Much recent research [8, 6, 7] suggests significant power and energy benefits of relaxing correctness constraints in future processors. Such processors with relaxed constraints ...
Joseph Sloan, John Sartori, Rakesh Kumar
VAMOS
2007
Springer
14 years 3 months ago
A Plea for Help with Variability, in Two Acts
A short theatrical exaggeration (but not too much) which describes practical problems with variability as experienced by real-world software developers. Real issue, there are no p...
Reed Little, Randy Blohm