Sciweavers

58 search results - page 9 / 12
» Almost Every Domain is Universal
Sort
View
ICALP
2011
Springer
12 years 10 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
IQ
2007
13 years 8 months ago
Rule-Based Measurement Of Data Quality In Nominal Data
: Sufficiently high data quality is crucial for almost every application. Nonetheless, data quality issues are nearly omnipresent. The reasons for poor quality cannot simply be bla...
Jochen Hipp, Markus Müller, Johannes Hohendor...
INLG
2010
Springer
13 years 4 months ago
Charting the Potential of Description Logic for the Generation of Referring Expressions
The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recen...
Yuan Ren, Kees van Deemter, Jeff Z. Pan
PAKDD
2011
ACM
419views Data Mining» more  PAKDD 2011»
12 years 9 months ago
DISC: Data-Intensive Similarity Measure for Categorical Data
Abstract. The concept of similarity is fundamentally important in almost every scientific field. Clustering, distance-based outlier detection, classification, regression and sea...
Aditya Desai, Himanshu Singh, Vikram Pudi
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
13 years 11 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden