Sciweavers

7006 search results - page 1224 / 1402
» Approximation Algorithms
Sort
View
WWW
2010
ACM
15 years 12 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura
241
Voted
AVSS
2009
IEEE
15 years 12 months ago
Global Illumination Compensation for Background Subtraction Using Gaussian-Based Background Difference Modeling
This paper presents a background segmentation technique, which is able to process acceptable segmentation masks under fast global illumination changes. The histogram of the frame-...
Julien A. Vijverberg, Marijn J. H. Loomans, Cornel...
156
Voted
CP
2009
Springer
15 years 11 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
IPMI
2009
Springer
15 years 11 months ago
Clustering of the Human Skeletal Muscle Fibers Using Linear Programming and Angular Hilbertian Metrics
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
Radhouène Neji, Ahmed Besbes, Nikos Komodak...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 11 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
« Prev « First page 1224 / 1402 Last » Next »