Sciweavers

1538 search results - page 257 / 308
» Relative Randomness and Cardinality
Sort
View
ACL
2011
14 years 1 months ago
Effective Measures of Domain Similarity for Parsing
It is well known that parsing accuracy suffers when a model is applied to out-of-domain data. It is also known that the most beneficial data to parse a given domain is data that ...
Barbara Plank, Gertjan van Noord
ESOP
2011
Springer
14 years 1 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
ESORICS
2009
Springer
14 years 7 months ago
Anonymity and Historical-Anonymity in Location-Based Services
The problem of protecting user's privacy in Location-Based Services (LBS) has been extensively studied recently and several defense techniques have been proposed. In this cont...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 5 days ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
CVPR
2012
IEEE
13 years 5 days ago
Discovering localized attributes for fine-grained recognition
Attributes are visual concepts that can be detected by machines, understood by humans, and shared across categories. They are particularly useful for fine-grained domains where c...
Kun Duan, Devi Parikh, David J. Crandall, Kristen ...