Sciweavers

1431 search results - page 162 / 287
» The complexity of random ordered structures
Sort
View
123
Voted
MT
2010
100views more  MT 2010»
15 years 1 months ago
Exploiting syntactic relationships in a phrase-based decoder: an exploration
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drastically oversimplified reordering models. Syntactically aware models make it pos...
Tim Hunter, Philip Resnik
ICEIS
2009
IEEE
15 years 10 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
121
Voted
CORR
2011
Springer
166views Education» more  CORR 2011»
14 years 7 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 7 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 4 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran