Sciweavers

2080 search results - page 172 / 416
» Measuring empirical computational complexity
Sort
View
154
Voted
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
15 years 10 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
92
Voted
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 9 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
CVPR
2005
IEEE
16 years 7 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
144
Voted
SIGCOMM
2006
ACM
15 years 11 months ago
Drafting behind Akamai (travelocity-based detouring)
To enhance web browsing experiences, content distribution networks (CDNs) move web content “closer” to clients by caching copies of web objects on thousands of servers worldwi...
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovi...
PAM
2007
Springer
15 years 11 months ago
Neuro-fuzzy Processing of Packet Dispersion Traces for Highly Variable Cross-Traffic Estimation
Cross-traffic data rate over the tight link of a path can be estimated using different active probing packet dispersion techniques. Many of these techniques send large amounts of p...
Marco A. Alzate, Néstor M. Peña, Mig...