93 search results - page 7 / 19 » What Makes the Arc-Preserving Subsequence Problem Hard |
SIGIR
2009
ACM
14 years 1 months ago
2009
ACM
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
ECCC
2007
13 years 7 months ago
2007
Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning ...