Sciweavers

2800 search results - page 404 / 560
» Scaling RDF with time
Sort
View
SCALESPACE
2001
Springer
15 years 11 months ago
A Multi-scale Feature Likelihood Map for Direct Evaluation of Object Hypotheses
This paper develops and investigates a new approach for evaluating feature based object hypotheses in a direct way. The idea is to compute a feature likelihood map (FLM), which is ...
Ivan Laptev, Tony Lindeberg
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
INFOCOM
2000
IEEE
15 years 11 months ago
Admission Control Based on End-to-End Measurements
— This paper proposes a controlled-load service that provides a network state with bounded and well known worst-case behavior. The service is primarily developed for real-time ap...
Viktória Elek, Gunnar Karlsson, Robert R&ou...
VISUALIZATION
2000
IEEE
15 years 11 months ago
A continuous clustering method for vector fields
A new method for the simplification of flow fields is presented. It is based on continuous clustering. A well-known physical clustering model, the Cahn Hillard model which desc...
Harald Garcke, Tobias Preußer, Martin Rumpf,...
DAWAK
2000
Springer
15 years 11 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton