Sciweavers

7796 search results - page 159 / 1560
» On Generalized Schur Numbers
Sort
View
CATS
2006
15 years 8 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
NIPS
2001
15 years 8 months ago
Generalizable Relational Binding from Coarse-coded Distributed Representations
We present a model of binding of relationship information in a spatial domain (e.g., square above triangle) that uses low-order coarse-coded conjunctive representations instead of...
Randall C. O'Reilly, R. S. Busby
SIGIR
2008
ACM
15 years 6 months ago
Relevance judgments between TREC and Non-TREC assessors
This paper investigates the agreement of relevance assessments between official TREC judgments and those generated from an interactive IR experiment. Results show that 63% of docu...
Azzah Al-Maskari, Mark Sanderson, Paul Clough
MAGS
2007
115views more  MAGS 2007»
15 years 6 months ago
Designing modular architectures in the framework AKIRA
AKIRA is an open source framework designed for parallel, asynchronous and distributed computation, on the basis of some general architectural principles which are inspired by modu...
Giovanni Pezzulo, Gianguglielmo Calvi
DMTCS
2008
80views Mathematics» more  DMTCS 2008»
15 years 5 months ago
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...
Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel