Sciweavers

10293 search results - page 163 / 2059
» Describing Semistructured Data
Sort
View
143
Voted
BMVC
1998
15 years 6 months ago
A Method for Dynamic Clustering of Data
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...
Arnaldo J. Abrantes, Jorge S. Marques
MVA
1990
137views Computer Vision» more  MVA 1990»
15 years 5 months ago
Relaxation Based Modeling and Recognition of 3D Surfaces from Range Data
Modeling and recognition of 3D objects by surface is an important problem in machine vision. Given a large number of range data points of an object surface, we present a relaxatio...
Chang Y. Choo, Nasser M. Nasrabadi, William I. Kwa...
IJHPCA
2006
122views more  IJHPCA 2006»
15 years 4 months ago
A New Hardware Monitor Design to Measure Data Structure-Specific Cache Eviction Information
In this paper, we propose a hardware performance monitor that provides support not only for measuring cache misses and the addresses associated with them, but also for determining...
Bryan R. Buck, Jeffrey K. Hollingsworth
PPL
2008
88views more  PPL 2008»
15 years 4 months ago
Evaluating Computational Costs while Handling Data and Control Parallelism
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
Sonia Campa
COR
2004
146views more  COR 2004»
15 years 4 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella