The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
In recent years, adaptation techniques have been given special focus in speaker recognition tasks, mainly targeting speaker and session variation disentangling under the Maximum a...
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
WormBase (http://wormbase.org), the public database for genomics and biology of Caenorhabditis elegans, has been restructured for stronger performance and expanded for richer biol...
Erich M. Schwarz, Igor Antoshechkin, Carol Bastian...
Multi-instance multi-label learning (MIML) refers to the
learning problems where each example is represented by a
bag/collection of instances and is labeled by multiple labels.
...
Rong Jin (Michigan State University), Shijun Wang...