Sciweavers

202 search results - page 20 / 41
» A New Measure for the Bandwidth Minimization Problem
Sort
View
ICDM
2007
IEEE
180views Data Mining» more  ICDM 2007»
14 years 1 months ago
Mining Frequent Itemsets in a Stream
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency ove...
Toon Calders, Nele Dexters, Bart Goethals
ISVC
2010
Springer
13 years 5 months ago
Robust Rigid Shape Registration Method Using a Level Set Formulation
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
Muayed S. Al-Huseiny, Sasan Mahmoodi, Mark S. Nixo...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
EOR
2007
79views more  EOR 2007»
13 years 7 months ago
The directional p
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
Laura E. Jackson, George N. Rouskas, Matthias F. M...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 7 months ago
Natural pseudo-distance and optimal matching between reduced size functions
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
Michele d'Amico, Patrizio Frosini, Claudia Landi