Sciweavers

4714 search results - page 170 / 943
» The Complexity of Iterated Multiplication
Sort
View
WIOPT
2010
IEEE
15 years 2 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos
TWC
2010
14 years 10 months ago
Managing the interference structure of MIMO HSDPA: a multi-user interference aware MMSE receiver with moderate complexity
It is known that Wideband Code-Division Multiple Access (W-CDMA) networks are limited by interference more than by any other single effect. Due to the frequency selectivity of the ...
Martin Wrulich, Christian Mehlführer, Markus ...
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 5 months ago
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
Loreto Bravo, Wenfei Fan, Floris Geerts, Shuai Ma
229
Voted
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 5 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
16 years 4 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan