Sciweavers

103 search results - page 13 / 21
» The Cover Time of Random Digraphs
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
BMCBI
2006
123views more  BMCBI 2006»
13 years 7 months ago
Permutation test for periodicity in short time series data
Background: Periodic processes, such as the circadian rhythm, are important factors modulating and coordinating transcription of genes governing key metabolic pathways. Theoretica...
Andrey A. Ptitsyn, Sanjin Zvonic, Jeffrey M. Gimbl...
PERCOM
2006
ACM
14 years 7 months ago
Localized Sensor Area Coverage with Low Communication Overhead
We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors...
Antoine Gallais, Jean Carle, David Simplot-Ryl, Iv...
COMPGEOM
1994
ACM
13 years 12 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
ADBIS
1999
Springer
98views Database» more  ADBIS 1999»
14 years 1 days ago
Processing of Spatio-Temporal Queries in Image Databases
Abstract. Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure s...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...