Sciweavers

985 search results - page 142 / 197
» Piercing Convex Sets
Sort
View
GIS
1999
ACM
14 years 2 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
WDAG
1994
Springer
123views Algorithms» more  WDAG 1994»
14 years 2 months ago
Breakpoints and Time in Distributed Computations
This paper investigates how vector time can be used to set breakpoints in distributed computations for the purpose of analyzing and debugging distributed programs. A breakpoint is ...
Twan Basten
DAC
2010
ACM
14 years 2 months ago
Representative path selection for post-silicon timing prediction under variability
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
Lin Xie, Azadeh Davoodi
EMO
2006
Springer
158views Optimization» more  EMO 2006»
14 years 1 months ago
The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobj...
Eckart Zitzler, Dimo Brockhoff, Lothar Thiele
AAAI
2010
13 years 11 months ago
Multi-Label Learning with Weak Label
Multi-label learning deals with data associated with multiple labels simultaneously. Previous work on multi-label learning assumes that for each instance, the "full" lab...
Yu-Yin Sun, Yin Zhang, Zhi-Hua Zhou