Sciweavers

1068 search results - page 26 / 214
» Factorization as a Rank 1 Problem
Sort
View
BMCBI
2006
184views more  BMCBI 2006»
14 years 9 months ago
PubFocus: semantic MEDLINE/PubMed citations analytics through integration of controlled biomedical dictionaries and ranking algo
Background: Understanding research activity within any given biomedical field is important. Search outputs generated by MEDLINE/PubMed are not well classified and require lengthy ...
Maksim V. Plikus, Zina Zhang, Cheng-Ming Chuong
WWW
2005
ACM
15 years 10 months ago
Ranking definitions with supervised learning methods
This paper is concerned with the problem of definition search. Specifically, given a term, we are to retrieve definitional excerpts of the term and rank the extracted excerpts acc...
Jun Xu, Yunbo Cao, Hang Li, Min Zhao
ECCC
2011
223views ECommerce» more  ECCC 2011»
14 years 4 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
IJCNN
2006
IEEE
15 years 3 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
MP
2006
121views more  MP 2006»
14 years 9 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg