655 search results - page 8 / 131 » Contrasting the Contrast Sets: An Alternative Approach |
ALGORITHMICA
2005
13 years 6 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
ECWEB
2010
Springer
13 years 8 months ago
2010
Springer
This research proposes a decision aid based on a novel type of preference relaxation, which enables consumers to easily make quality choices in online multiattribute choice scenari...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
ISPE
2003
13 years 8 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
MICCAI
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we propose a weakly supervised learning algorithm for appearance models based on the minimum description length (MDL) principle. From a set of training images or volu...