Sciweavers

5580 search results - page 804 / 1116
» Randomized priority algorithms
Sort
View
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 3 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
118
Voted
DCC
2005
IEEE
16 years 3 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 17 days ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
132
Voted
CCS
2010
ACM
15 years 10 months ago
Bureaucratic protocols for secure two-party sorting, selection, and permuting
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenlia...
123
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
Asynchronous Congestion Games
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
Michal Penn, Maria Polukarov, Moshe Tennenholtz