Sciweavers

5350 search results - page 343 / 1070
» Space and time in eco-ontologies
Sort
View
EJASP
2011
93views more  EJASP 2011»
15 years 1 months ago
Cognitive Cooperation for the Downlink of Frequency Reuse Small Cells
We develop and analyze a space time coded cooperative diversity protocol that achieves improved quality of service for mobile users in the downlink of small cells. The protocol, c...
Salam Akoum, Marie Zwingelstein-Colin, Robert W. H...
191
Voted
FOCS
2008
IEEE
16 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICDE
2010
IEEE
222views Database» more  ICDE 2010»
15 years 5 months ago
Finding Clusters in subspaces of very large, multi-dimensional datasets
Abstract— We propose the Multi-resolution Correlation Cluster detection (MrCC), a novel, scalable method to detect correlation clusters able to analyze dimensional data in the ra...
Robson Leonardo Ferreira Cordeiro, Agma J. M. Trai...
DCC
2008
IEEE
16 years 6 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
DCC
2008
IEEE
16 years 6 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth