1258 search results - page 72 / 252 » Architecture-driven Problem Decomposition |
DATE
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
NIPS
2007
13 years 10 months ago
2007
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
IIS
2004
13 years 10 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
NIPS
2003
13 years 10 months ago
2003
We interpret non-negative matrix factorization geometrically, as the problem of finding a simplicial cone which contains a cloud of data points and which is contained in the posi...