Sciweavers

1952 search results - page 339 / 391
» Complete partitions of graphs
Sort
View
COLT
1993
Springer
15 years 8 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
DCOSS
2006
Springer
15 years 8 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
122
Voted
BMCBI
2008
116views more  BMCBI 2008»
15 years 4 months ago
Algorithm of OMA for large-scale orthology inference
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
Alexander C. J. Roth, Gaston H. Gonnet, Christophe...
WWW
2005
ACM
16 years 5 months ago
Diversified SCM standard for the Japanese retail industry
In this paper, we present the concept of a diversified SCM (supply chain management) standard and distributed hub architecture which were used in B2B experiments for the Japanese ...
Koichi Hayashi, Naoki Koguro, Reki Murakami
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 4 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar