17688 search results - page 411 / 3538 » Data Set Balancing |
188
click to vote
WADS
1997
Springer
15 years 11 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
147
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper the problem of off-line handwritten cursive text recognition is considered. A method for expanding the set of available training textlines by applying random perturb...
269
click to vote
IJISEC
2007
15 years 6 months ago
2007
The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set DB of data elements can be represented in terms of its complement set...
159
click to vote
ACL
2009
15 years 4 months ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
178
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...