29908 search results - page 5820 / 5982 » On the complexity of communication complexity |
158
click to vote
TCS
2008
15 years 6 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
155
click to vote
IPL
2007
15 years 6 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
182
click to vote
IPM
2007
15 years 6 months ago
2007
In the KL divergence framework, the extended language modeling approach has a critical problem estimating a query model, which is the probabilistic model that encodes user’s inf...
188
click to vote
IR
2007
15 years 6 months ago
2007
This paper reports on the underlying IR problems encountered when indexing and searching with the Bulgarian language. For this language we propose a general light stemmer and demon...
185
click to vote
TCSV
2008
15 years 6 months ago
2008
Abstract--Various 3-D face synthesis techniques have been proposed and extensively used in many applications. Compared with others, single view-based face synthesis technology allo...