Sciweavers

838 search results - page 78 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
94
Voted
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
15 years 6 months ago
Faster exploration of high level design alternatives using UML for better partitions
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
Waseem Ahmed, Doug Myers
ECAI
2004
Springer
15 years 5 months ago
Agreements Without Disagreements
The first part of this paper presents a coalition formation method for multi-agent systems which finds a Pareto optimal solution without aggregating the preferences of the agents. ...
Samir Aknine, Philippe Caillou
ICC
2009
IEEE
101views Communications» more  ICC 2009»
14 years 9 months ago
Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System
In this paper, we study power allocation (PA) in a single-relay OFDM system with limited feedback. We propose a PA scheme that uses a codebook of quantized PA vectors designed offl...
Mahdi Hajiaghayi, Min Dong, Ben Liang
ICCV
2009
IEEE
16 years 4 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl