459 search results - page 38 / 92 » Average Case Analysis of Conjunctive Learning Algorithms |
165
click to vote
JSAC
2007
15 years 5 months ago
2007
— Despite its low-complexity, the zero-forcing receiver is known to suffer from noise enhancement to restore the spatially multiplexed data in a single-user MIMO system. Neverthe...
175
click to vote
TMA
2010
Springer
16 years 10 days ago
2010
Springer
In this work we discuss the use of passive measurements of TCP performance indicators in support of network operation and troubleshooting, presenting a case-study from a real 3G ce...
202
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
127
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
184
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...