Sciweavers

580 search results - page 46 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
GEOINFO
2004
15 years 3 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
141
Voted
FOCS
1995
IEEE
15 years 6 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
135
Voted
ICLP
2010
Springer
15 years 5 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens
108
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Sequential Monte Carlo method for parameter estimation in diffusion models of affinity-based biosensors
Estimation of the amounts of target molecules in realtime affinity-based biosensors is studied. The problem is mapped to inferring the parameters of a temporally sampled diffusio...
Manohar Shamaiah, Xiaohu Shen, Haris Vikalo
CN
2004
109views more  CN 2004»
15 years 2 months ago
Modeling correlations in web traces and implications for designing replacement policies
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...
Konstantinos Psounis, An Zhu, Balaji Prabhakar, Ra...