Sciweavers

2830 search results - page 207 / 566
» No Science without Semantics
Sort
View
COMPGEOM
2003
ACM
14 years 2 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
COMPGEOM
2010
ACM
14 years 2 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
ICFP
2008
ACM
14 years 9 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
CSE
2009
IEEE
14 years 4 months ago
Private Buddy Search: Enabling Private Spatial Queries in Social Networks
—With the abundance of location-aware portable devices such as cellphones and PDAs, a new emerging application is to use this pervasive computing platform to learn about the wher...
Ali Khoshgozaran, Cyrus Shahabi
FOCS
2008
IEEE
14 years 4 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...