125 search results - page 7 / 25 » N Semantic Classes are Harder than Two |
CIVR
2006
Springer
15 years 1 months ago
2006
Springer
High-dimensional index is one of the most challenging tasks for content-based video retrieval (CBVR). Typically, in video database, there exist two kinds of clues for query: visual...
COLING
2010
14 years 4 months ago
2010
In this paper we present a simplified shallow semantic parsing approach to learning the scope of negation (SoN). This is done by formulating it as a shallow semantic parsing probl...
ECCC
2008
14 years 9 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
ML
2007
ACM
14 years 9 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
INDOCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...