Sciweavers

100 search results - page 15 / 20
» Making revision reversible: an approach based on polynomials
Sort
View
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
14 years 11 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
80
Voted
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
FOCS
1995
IEEE
15 years 1 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
TPDS
2010
256views more  TPDS 2010»
14 years 7 months ago
Privacy-Conscious Location-Based Queries in Mobile Environments
— In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing...
Jianliang Xu, Xueyan Tang, Haibo Hu, Jing Du
ARGMAS
2007
Springer
15 years 1 months ago
Arguing and Explaining Classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
Leila Amgoud, Mathieu Serrurier