7602 search results - page 225 / 1521 » A New Approach to Base Revision |
166
click to vote
NIPS
2007
15 years 8 months ago
2007
We study the problem of an apprentice learning to behave in an environment with an unknown reward function by observing the behavior of an expert. We follow on the work of Abbeel ...
177
click to vote
CSJM
2006
15 years 6 months ago
2006
A new method is proposed to design short signature schemes based on difficulty of factorizing a composite number n = qr, where q and r are two large primes. Using the method new d...
176
click to vote
EOR
2006
15 years 6 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
194
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we define and study a new opinionated text data analysis problem called Latent Aspect Rating Analysis (LARA), which aims at analyzing opinions expressed about an e...
200
click to vote
DSP
2008
15 years 5 months ago
2008
In this paper we present a methodical evaluation of the performance of a new and two traditional approaches to automatic target recognition (ATR) based on silhouette representatio...