1688 search results - page 205 / 338 » The Complexity of Rationalizing Matchings |
PRICAI
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
WAOA
2004
Springer
15 years 4 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
ASYNC
2003
IEEE
15 years 4 months ago
2003
IEEE
We present a high-speed, clockless, serial link transceiver for inter-chip communication in asynchronous VLSI systems. Serial link transceivers achieve high offchip data rates by ...
ITCC
2003
IEEE
15 years 4 months ago
2003
IEEE
: Motion is an important cue for many applications. Here we propose a solution for estimating motion from a sequence of images using three algorithms, viz., Batch, Recursive and Bo...
SAINT
2003
IEEE
15 years 4 months ago
2003
IEEE
Web service technologies promise to facilitate collaboration among business partners by helping potential business partners find one another and integrate their business processe...