Sciweavers

2030 search results - page 330 / 406
» Estimation of Chaotic Probabilities
Sort
View
COMPGEOM
1993
ACM
14 years 1 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
ALGOSENSORS
2007
Springer
14 years 1 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
AUTONOMICS
2007
ACM
14 years 1 months ago
Adaptive learning of semantic locations and routes
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...
Keshu Zhang, Haifeng Li, Kari Torkkola, Mike Gardn...
DSD
2007
IEEE
132views Hardware» more  DSD 2007»
14 years 1 months ago
On-Chip Cache Device Scaling Limits and Effective Fault Repair Techniques in Future Nanoscale Technology
In this study, we investigate different cache fault tolerance techniques to determine which will be most effective when on-chip memory cell defect probabilities exceed those of cu...
David Roberts, Nam Sung Kim, Trevor N. Mudge
ACSC
2004
IEEE
14 years 1 months ago
Lossless Image Compression Using Pixel Reordering
Lossless image compression techniques typically consider images to be a sequence of pixels in row major order. The processing of each pixel consists of two separate operations. Th...
Michael Ciavarella, Alistair Moffat