Sciweavers

2035 search results - page 319 / 407
» Working memory
Sort
View
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
15 years 3 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
IPAS
2007
15 years 2 months ago
Prediction of signs of DCT coefficients in block-based lossy image compression
A practical impossibility of prediction of signs of DCT coefficients is generally accepted. Therefore each coded sign of DCT coefficients occupies usually 1 bit of memory in compr...
Nikolay N. Ponomarenko, Andriy V. Bazhyna, Karen O...
AAAI
2008
15 years 2 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
AIIDE
2008
15 years 2 months ago
Offline Planning with Hierarchical Task Networks in Video Games
Artificial intelligence (AI) technology can have a dramatic impact on the quality of video games. AI planning techniques are useful in a wide range of game components, including m...
John Paul Kelly, Adi Botea, Sven Koenig
CAV
2008
Springer
108views Hardware» more  CAV 2008»
15 years 1 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps