Sciweavers

522 search results - page 38 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
WSDM
2010
ACM
173views Data Mining» more  WSDM 2010»
14 years 5 months ago
Measuring the Reusability of Test Collections
While test collection construction is a time-consuming and expensive process, the true cost is amortized by reusing the collection over hundreds or thousands of experiments. Some ...
Ben Carterette, Evgeniy Gabrilovich, Vanja Josifov...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 5 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
RTCSA
2009
IEEE
14 years 2 months ago
Branch Target Buffers: WCET Analysis Framework and Timing Predictability
—One step in the verification of hard real-time systems is to determine upper bounds on the worst-case execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis h...
Daniel Grund, Jan Reineke, Gernot Gebhard
KIVS
2009
Springer
14 years 2 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
ICUIMC
2009
ACM
14 years 2 months ago
Metadata management for integration and analysis of earth observation data
Earth observation technologies have developed rapidly during the last decades. Substantial amounts of earth observation data have been acquired and stored among the literature and...
Akira Takahashi, Masashi Tatedoko, Hiroko Kinutani...