Sciweavers

893 search results - page 73 / 179
» Relational link-based ranking
Sort
View
IMCSIT
2010
13 years 7 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
14 years 1 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
AMR
2006
Springer
96views Multimedia» more  AMR 2006»
14 years 1 months ago
Learning to Retrieve Images from Text Queries with a Discriminative Model
This work presents a discriminative model for the retrieval of pictures from text queries. The core idea of this approach is to minimize a loss directly related to the retrieval pe...
David Grangier, Florent Monay, Samy Bengio
TREC
2004
13 years 10 months ago
The University of Michigan in Novelty 2004
This year we participated in the Novelty track. To find the relevant sentences, we combine sentence salience features that are inherited from text summarization domain with other ...
Günes Erkan
AMAI
2010
Springer
13 years 6 months ago
Comparing multiagent systems research in combinatorial auctions and voting
In a combinatorial auction, a set of resources is for sale, and agents can bid on subsets of these resources. In a voting setting, the agents decide among a set of alternatives by...
Vincent Conitzer