Sciweavers

2542 search results - page 235 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
TSP
2008
113views more  TSP 2008»
15 years 15 days ago
Avoiding Divergence in the Shalvi-Weinstein Algorithm
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...
ECCV
2010
Springer
14 years 10 months ago
Discriminative Nonorthogonal Binary Subspace Tracking
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
Ang Li, Feng Tang, Yanwen Guo, Hai Tao
106
Voted
CP
2010
Springer
14 years 11 months ago
An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...
SIGIR
2011
ACM
14 years 3 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
77
Voted
ICSE
2010
IEEE-ACM
15 years 2 months ago
Quality of service profiling
Many computations exhibit a trade off between execution time and quality of service. A video encoder, for example, can often encode frames more quickly if it is given the freedom ...
Sasa Misailovic, Stelios Sidiroglou, Henry Hoffman...