Sciweavers

21 search results - page 2 / 5
» Search Techniques for Rational Polynomial Orders
Sort
View
TSP
2010
12 years 12 months ago
A low complexity blind estimator of narrowband polynomial phase signals
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
Alon Amar, Amir Leshem, Alle-Jan van der Veen
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
13 years 8 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
12 years 8 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
JMLR
2006
117views more  JMLR 2006»
13 years 5 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
SOFSEM
2010
Springer
14 years 2 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons