Sciweavers

16404 search results - page 644 / 3281
» A set coverage problem
Sort
View
COSIT
2011
Springer
269views GIS» more  COSIT 2011»
14 years 7 months ago
Analyzing the Spatial-Semantic Interaction of Points of Interest in Volunteered Geographic Information
With the increasing success and commercial integration of Volunteered Geographic Information (VGI), the focus shifts away from coverage to data quality and homogeneity. Within the ...
Christoph Mülligann, Krzysztof Janowicz, Mao ...
LICS
2009
IEEE
16 years 1 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 23 days ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
15 years 8 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street
COCOON
2005
Springer
16 years 21 days ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang