Sciweavers

2412 search results - page 268 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
112
Voted
WAIM
2007
Springer
15 years 9 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
142
Voted
ICCV
2007
IEEE
16 years 5 months ago
Spectral Regression for Efficient Regularized Subspace Learning
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
Deng Cai, Xiaofei He, Jiawei Han
JAPLL
2008
91views more  JAPLL 2008»
15 years 3 months ago
Undoing the effects of action sequences
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
Thomas Eiter, Esra Erdem, Wolfgang Faber
142
Voted
AI
2003
Springer
15 years 9 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
151
Voted
SOFSEM
1999
Springer
15 years 8 months ago
Coherent Concepts, Robust Learning
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
Dan Roth, Dmitry Zelenko