4541 search results - page 390 / 909 » Cache-Oblivious Algorithms and Data Structures |
171
click to vote
ICFP
2012
ACM
13 years 7 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
169
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...
130
click to vote
PKDD
1999
Springer
15 years 9 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
134
click to vote
ICVGIP
2008
15 years 6 months ago
2008
The GPUs pack high computation power and a restricted architecture into easily available hardware today. They are now used as computation co-processors and come with programming m...
160
click to vote
ENTCS
2008
15 years 4 months 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...