Sciweavers

332 search results - page 2 / 67
» Space Complexity vs. Query Complexity
Sort
View
PIMRC
2008
IEEE
14 years 5 days ago
Real vs. complex BPSK precoding for MIMO broadcast channels
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...
Rodrigo de Miguel, Ralf R. Müller
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 7 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
ALT
1998
Springer
13 years 10 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ADBIS
2010
Springer
145views Database» more  ADBIS 2010»
13 years 3 months ago
Faceoff: Surrogate vs. Natural Keys
Abstract. The natural and surrogate key architectures are two competing approaches to specifying keys in relational databases. We analyze the performance of these approaches with r...
Slavica Aleksic, Milan Celikovic, Sebastian Link, ...
ER
2005
Springer
94views Database» more  ER 2005»
13 years 11 months ago
Topological Relationships Between Complex Lines and Complex Regions
Abstract. Topological relationships between spatial objects in the twodimensional space have been investigated for a long time in a number of disciplines like artificial intellige...
Markus Schneider, Thomas Behr