Sciweavers

11212 search results - page 409 / 2243
» Semi-persistent Data Structures
Sort
View
SEBD
2003
154views Database» more  SEBD 2003»
15 years 8 months ago
Management of User Preferences in Data Intensive Applications
Abstract. The management of user preferences is becoming a fundamental ingredient of modern Web-based data-intensive applications, in which information filtering is crucial to red...
Riccardo Torlone, Paolo Ciaccia
DAWAK
2010
Springer
15 years 7 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
ICML
2010
IEEE
15 years 7 months ago
Active Learning for Networked Data
We introduce a novel active learning algorithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the label...
Mustafa Bilgic, Lilyana Mihalkova, Lise Getoor
CVIU
2007
149views more  CVIU 2007»
15 years 6 months ago
A volumetric fusion technique for surface reconstruction from silhouettes and range data
Optical triangulation, an active reconstruction technique, is known to be an accurate method but has several shortcomings due to occlusion and laser reflectance properties of the...
Yücel Yemez, C. J. Wetherilt
PRL
2006
139views more  PRL 2006»
15 years 6 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...