Sciweavers

425 search results - page 35 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
120
Voted
PODS
2012
ACM
297views Database» more  PODS 2012»
12 years 12 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
PODC
2010
ACM
15 years 1 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
ICDM
2006
IEEE
113views Data Mining» more  ICDM 2006»
15 years 3 months ago
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints
In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without assoc...
Vania Bogorny, João Francisco Valiati, Sand...
75
Voted
ICML
2008
IEEE
15 years 10 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh