1431 search results - page 157 / 287 » The complexity of random ordered structures |
117
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
140
click to vote
SDM
2003
SIAM
15 years 4 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
134
Voted
ICCD
2004
IEEE
16 years 7 days ago
2004
IEEE
This short paper explores an implementation of a new technology called 3D die stacking and describes research activity at Intel. 3D die stacking is the bonding of two die either f...
135
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
A method that automatically estimates the metrical structure of a piece of music is presented. The approach is based on the generation of a beat similarity matrix, which provides ...
154
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...