Sciweavers

11321 search results - page 317 / 2265
» Improvements to Turing's method
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
14 years 6 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
WWW
2004
ACM
16 years 7 months ago
A method for transparent admission control and request scheduling in e-commerce web sites
This paper presents a method for admission control and request scheduling for multiply-tiered e-commerce Web sites, achieving both stable behavior during overload and improved res...
Sameh Elnikety, Erich M. Nahum, John M. Tracey, Wi...
SADM
2008
178views more  SADM 2008»
15 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
KDD
2004
ACM
163views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting dictionaries in named entity extraction: combining semi-Markov extraction processes and data integration methods
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
William W. Cohen, Sunita Sarawagi
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
16 years 13 days ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...