Sciweavers

81 search results - page 2 / 17
» A Linear Time and Space Algorithm for Detecting Path Interse...
Sort
View
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 5 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
VTC
2006
IEEE
174views Communications» more  VTC 2006»
13 years 11 months ago
ML Detection with Blind Linear Prediction for Differential Space-Time Block Code Systems
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...
Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi ...
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 9 days ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 11 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh