Sciweavers

321 search results - page 18 / 65
» Partitioning by iterative deletion
Sort
View
COMPGEOM
1993
ACM
14 years 2 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...
FUIN
2010
94views more  FUIN 2010»
13 years 8 months ago
A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to probabilistic inputs, is appropr...
Salem Benferhat, Didier Dubois, Henri Prade, Mary-...
EJC
2006
13 years 10 months ago
An iterative-bijective approach to generalizations of Schur's theorem
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
Sylvie Corteel, Jeremy Lovejoy
ISSS
1999
IEEE
89views Hardware» more  ISSS 1999»
14 years 2 months ago
Loop Scheduling and Partitions for Hiding Memory Latencies
Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is...
Fei Chen, Edwin Hsing-Mean Sha
DATE
2004
IEEE
114views Hardware» more  DATE 2004»
14 years 1 months ago
Power Aware Variable Partitioning and Instruction Scheduling for Multiple Memory Banks
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
Zhong Wang, Xiaobo Sharon Hu