Sciweavers

537 search results - page 73 / 108
» A new upper bound for 3-SAT
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
PODC
2004
ACM
14 years 1 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
14 years 10 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
ICPR
2000
IEEE
14 years 9 months ago
Stability Analysis of Medial Axis Transform under Relative Hausdorff Distance
Medial axis transform (MAT) is a basic tool for shape analysis. But, in spite of its usefulness, it has some drawbacks, one of which is its instability under the boundary perturba...
Sung Woo Choi, Seong-Whan Lee
ICC
2008
IEEE
120views Communications» more  ICC 2008»
14 years 3 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan