Sciweavers

16093 search results - page 2779 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 7 months ago
Spectral domain-transfer learning
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Qiang Yang, ...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 7 months ago
Spying Out Accurate User Preferences for Search Engine Adaptation
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
Lin Deng, Wilfred Ng, Xiaoyong Chai, Dik Lun Lee
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 7 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 7 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 7 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
« Prev « First page 2779 / 3219 Last » Next »