Sciweavers

1322 search results - page 66 / 265
» Parameterized counting problems
Sort
View
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 2 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
COMPGEOM
2000
ACM
14 years 1 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 1 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
COLING
2010
13 years 3 months ago
A Logistic Regression Model of Determiner Omission in PPs
The realization of singular count nouns without an accompanying determiner inside a PP (determinerless PP, bare PP, Preposition-Noun Combination) has recently attracted some inter...
Tibor Kiss, Katja Keßelmeier, Antje Mül...
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 10 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...