5580 search results - page 678 / 1116 » Randomized priority algorithms |
124
click to vote
ALDT
2009
Springer
15 years 8 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
148
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
150
click to vote
ICANN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
145
click to vote
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
152
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...