Sciweavers

17760 search results - page 11 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
AAAI
2000
14 years 11 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 2 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
ICPR
2006
IEEE
15 years 10 months ago
A General Framework for Agglomerative Hierarchical Clustering Algorithms
This paper presents a general framework for agglomerative hierarchical clustering based on graphs. Specifying an inter-cluster similarity measure, a subgraph of the similarity gra...
Reynaldo Gil-García, José Manuel Bad...
ACL
2003
14 years 11 months ago
Generalized Algorithms for Constructing Statistical Language Models
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
Cyril Allauzen, Mehryar Mohri, Brian Roark