Sciweavers

4908 search results - page 130 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 10 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
15 years 6 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
IROS
2006
IEEE
111views Robotics» more  IROS 2006»
16 years 13 days ago
Optimization of Industrial Applications with Hardware in the Loop
This paper deals with optimizing the task cycle time of industrial robots integrated in complex robot cells. Trajectory optimizers are usually based on models and can’t properly...
Matthieu Guilbert, Pierre-Brice Wieber, Luc D. Jol...
ICASSP
2009
IEEE
16 years 1 months ago
Rate-distortion optimized bitstream extractor for motion scalability in scalable video coding
Motion scalability is designed to improve the coding efficiency of a scalable video coding framework, especially in the medium to low range of decoding bit rates or spatial resol...
Meng-Ping Kao, Truong Nguyen
IPPS
2006
IEEE
16 years 13 days ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...