Sciweavers

994 search results - page 169 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
CVPR
2006
IEEE
14 years 1 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 2 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
NIPS
2001
13 years 8 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
AAAI
2012
11 years 9 months ago
Online Kernel Selection: Algorithms and Evaluations
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Y...
PERCOM
2007
ACM
14 years 7 months ago
Context Aware Routing of Enterprise User Communications
This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locatio...
Munmun De Choudhury, Hari Sundaram, Ajita John, Do...