Sciweavers

1365 search results - page 263 / 273
» Using Web-Search Results to Measure Word-Group Similarity
Sort
View
PAMI
2002
114views more  PAMI 2002»
13 years 8 months ago
Principal Manifolds and Probabilistic Subspaces for Visual Recognition
We investigate the use of linear and nonlinear principal manifolds for learning low-dimensional representations for visual recognition. Several leading techniques: Principal Compo...
Baback Moghaddam
JCM
2010
119views more  JCM 2010»
13 years 7 months ago
Evaluation of Router Implementations for Explicit Congestion Control Schemes
— Explicit congestion control schemes use router feedback to overcome limitations of the standard mechanisms of the Transmission Control Protocol (TCP). These approaches require ...
Simon Hauger, Michael Scharf, Jochen Kögel, C...
BMCBI
2008
138views more  BMCBI 2008»
13 years 8 months ago
Comparative analyses of bidirectional promoters in vertebrates
Background: Orthologous genes with deep phylogenetic histories are likely to retain similar regulatory features. In this report we utilize orthology assignments for pairs of genes...
Mary Qu Yang, James Taylor, Laura Elnitski
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
14 years 9 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 8 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...