6368 search results - page 932 / 1274 » Modeling Problem Transformations based on Data Complexity |
156
click to vote
CAS
2007
15 years 6 months ago
2007
Today, with the advances of computer storage and technology, there are huge datasets available, offering an opportunity to extract valuable information. Probabilistic approaches ...
202
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
179
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
179
click to vote
COMPGEOM
2006
ACM
16 years 25 days ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
184
click to vote
DATE
2005
IEEE
16 years 14 days 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...