Sciweavers

2027 search results - page 237 / 406
» When is it best to best-respond
Sort
View
PODC
1996
ACM
15 years 5 months ago
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
Maged M. Michael, Michael L. Scott
VLDB
1997
ACM
175views Database» more  VLDB 1997»
15 years 5 months ago
STING: A Statistical Information Grid Approach to Spatial Data Mining
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
Wei Wang 0010, Jiong Yang, Richard R. Muntz
ICDT
2010
ACM
125views Database» more  ICDT 2010»
15 years 5 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
ESA
1993
Springer
140views Algorithms» more  ESA 1993»
15 years 5 months ago
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
Zoran Ivkovic, Errol L. Lloyd
ACNS
2009
Springer
150views Cryptology» more  ACNS 2009»
15 years 5 months ago
How to Compare Profiled Side-Channel Attacks?
Side-channel attacks are an important class of attacks against cryptographic devices and profiled side-channel attacks are the most powerful type of side-channel attacks. In this s...
François-Xavier Standaert, François ...