1802 search results - page 237 / 361 » Complexity Theory for Operators in Analysis |
176
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
181
click to vote
CIE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
186
click to vote
MICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
178
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
179
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...