2830 search results - page 207 / 566 » No Science without Semantics |
137
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
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...
141
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
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...
147
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
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 ...
150
Voted
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
—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...
125
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
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...