Sciweavers

7820 search results - page 1301 / 1564
» Formalization of Time and Space
Sort
View
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
16 years 7 days ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
ICS
2010
Tsinghua U.
16 years 6 days ago
Cache oblivious parallelograms in iterative stencil computations
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak, Ha...
COMPSAC
2009
IEEE
16 years 3 days ago
ELALPS: A Framework to Eliminate Location Anonymizer from Location Privacy Systems
—Countless challenges to preserving a user’s location privacy exist and have become more important than ever before with the proliferation of handheld devices and the pervasive...
Mehrab Monjur, Sheikh Iqbal Ahamed, Chowdhury Shar...
COMPGEOM
2009
ACM
16 years 2 days ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
SPAA
2009
ACM
16 years 2 days ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
« Prev « First page 1301 / 1564 Last » Next »