Sciweavers

778 search results - page 84 / 156
» Improved universal denominators
Sort
View
JCT
2011
86views more  JCT 2011»
14 years 4 months ago
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
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...
Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu
ICASSP
2011
IEEE
14 years 1 months ago
Structural MAP adaptation in GMM-supervector based speaker recognition
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...
Marc Ferras, Koichi Shinoda, Sadaoki Furui
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
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 ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
NAR
2006
85views more  NAR 2006»
14 years 9 months ago
WormBase: better software, richer content
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...
CVPR
2009
IEEE
16 years 5 months ago
Learning a Distance Metric from Multi-instance Multi-label Data
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...