6365 search results - page 1209 / 1273 » Fast Local Computation Algorithms |
129
Voted
GLOBECOM
2008
IEEE
15 years 22 days ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
126
Voted
AUTOMATICA
2008
15 years 22 days ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
98
Voted
CGF
2010
15 years 21 days ago
2010
For each scanned object 3D triangulation laser scanners deliver multiple sweeps corresponding to multiple laser motions and orientations. The problem of aligning these scans has b...
77
Voted
COGSCI
2010
15 years 21 days ago
2010
Judging similarities among objects, events, and experiences is one of the most basic cognitive abilities, allowing us to make predictions and generalizations. The main assumption ...
120
Voted
ENTCS
2008
15 years 20 days ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...