740 search results - page 92 / 148 » Lower bounds for Buchsbaum* complexes |
181
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
230
click to vote
ICDE
2012
IEEE
14 years 5 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
180
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
168
click to vote
CCCG
2008
15 years 7 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
187
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...