Sciweavers

151 search results - page 13 / 31
» Computable Shell Decomposition Bounds
Sort
View
FOCS
2003
IEEE
14 years 21 days ago
Bounded Geometries, Fractals, and Low-Distortion Embeddings
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
Anupam Gupta, Robert Krauthgamer, James R. Lee
ECCV
2008
Springer
14 years 9 months ago
Multi-layered Decomposition of Recurrent Scenes
Abstract. There is considerable interest in techniques capable of identifying anomalies and unusual events in busy outdoor scenes, e.g. road junctions. Many approaches achieve this...
David Mark Russell, Shaogang Gong
AAECC
2008
Springer
63views Algorithms» more  AAECC 2008»
13 years 7 months ago
Probabilistic algorithms for computing resolvent representations of regular differential ideals
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
Thomas Cluzeau, Evelyne Hubert
ICC
2007
IEEE
147views Communications» more  ICC 2007»
14 years 1 months ago
MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
Yanxiang Jiang, Xiaohu You, Xiqi Gao, Hlaing Minn
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...