14699 search results - page 2939 / 2940 » Complexity and Cognitive Computing |
112
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
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 ...
127
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
163
Voted
ICSE
2007
IEEE-ACM
15 years 7 months ago
2007
IEEE-ACM
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
118
Voted
ISPA
2005
Springer
15 years 6 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
145
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...