Sciweavers

14298 search results - page 2812 / 2860
» Dynamic Languages and Applications
Sort
View
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
16 years 4 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
16 years 4 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
KDD
2004
ACM
192views Data Mining» more  KDD 2004»
16 years 4 months ago
Mining and summarizing customer reviews
Merchants selling products on the Web often ask their customers to review the products that they have purchased and the associated services. As e-commerce is becoming more and mor...
Minqing Hu, Bing Liu
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
ICALP
2009
Springer
16 years 4 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
« Prev « First page 2812 / 2860 Last » Next »