17967 search results - page 3440 / 3594 » Functional timing optimization |
142
click to vote
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
136
click to vote
BTW
2007
Springer
15 years 7 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
162
click to vote
ECOWS
2007
Springer
15 years 7 months ago
2007
Springer
Web services are self-contained, modular units of application logic which provide business functionality to other applications via Internet connections. Several models have been u...
111
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
152
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...