Sciweavers

372 search results - page 17 / 75
» On Finding Small 2-Generating Sets
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
ANLP
1997
84views more  ANLP 1997»
14 years 10 months ago
High Performance Segmentation of Spontaneous Speech Using Part of Speech and Trigger Word Information
We describe and experimentally evaluate an efficient method for automatically determining small clause boundaries in spontaneous speech. Our method applies an artificial neural ne...
Marsal Gavaldà, Klaus Zechner, Gregory Aist
RECOMB
2006
Springer
15 years 9 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
KDD
1995
ACM
139views Data Mining» more  KDD 1995»
15 years 1 months ago
Extracting Support Data for a Given Task
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...
Bernhard Schölkopf, Chris Burges, Vladimir Va...
EMNLP
2006
14 years 11 months ago
Random Indexing using Statistical Weight Functions
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
James Gorman, James R. Curran