7106 search results - page 1126 / 1422 » Restricted Complexity, General Complexity |
212
click to vote
TALG
2008
15 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
188
click to vote
TASLP
2008
15 years 6 months ago
2008
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
199
click to vote
TCOM
2008
15 years 6 months ago
2008
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
164
click to vote
IPL
2007
15 years 6 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
184
click to vote
IS
2007
15 years 6 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...