Sciweavers

4536 search results - page 406 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PKDD
1999
Springer
130views Data Mining» more  PKDD 1999»
15 years 11 months ago
OPTICS-OF: Identifying Local Outliers
: 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...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
INFOCOM
2000
IEEE
15 years 11 months ago
Fast and Scalable Priority Queue Architecture for High-Speed Network Switches
-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...
Ranjita Bhagwan, Bill Lin
ICVGIP
2008
15 years 8 months ago
Ray Casting Deformable Models on the GPU
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...
Suryakant Patidar, P. J. Narayanan
ENTCS
2008
120views more  ENTCS 2008»
15 years 7 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
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...
Alan P. Sexton, Hayo Thielecke
CAD
2004
Springer
15 years 6 months ago
A multi-resolution topological representation for non-manifold meshes
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...
Leila De Floriani, Paola Magillo, Enrico Puppo, Da...