Sciweavers

7150 search results - page 15 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 2 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
IR
2010
14 years 11 months ago
A general approximation framework for direct optimization of information retrieval measures
Recently direct optimization of information retrieval (IR) measures becomes a new trend in learning to rank. Several methods have been proposed and the effectiveness of them has ...
Tao Qin, Tie-Yan Liu, Hang Li
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 15 days ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 7 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
101
Voted
SDM
2007
SIAM
96views Data Mining» more  SDM 2007»
15 years 1 months ago
Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAM
This paper presents a unified view of a number of dimension reduction techniques under the common framework of tensors. Specifically, it is established that PCA, and the recentl...
Bernard N. Sheehan, Yousef Saad