Sciweavers

1403 search results - page 199 / 281
» Set cover algorithms for very large datasets
Sort
View
COMAD
2008
14 years 11 months ago
CUM: An Efficient Framework for Mining Concept Units
Web is the most important repository of different kinds of media such as text, sound, video, images etc. Web mining is the process of applying data mining techniques to automatica...
Santhi Thilagam
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 10 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
SIGCOMM
2004
ACM
15 years 3 months ago
Optimizing cost and performance for multihoming
Multihoming is often used by large enterprises and stub ISPs to connect to the Internet. In this paper, we design a series of novel smart routing algorithms to optimize cost and p...
David Kiyoshi Goldenberg, Lili Qiu, Haiyong Xie 00...
CN
2008
108views more  CN 2008»
14 years 10 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
BMCBI
2008
109views more  BMCBI 2008»
14 years 10 months ago
LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons
Background: Transposable elements are abundant in eukaryotic genomes and it is believed that they have a significant impact on the evolution of gene and chromosome structure. Whil...
David Ellinghaus, Stefan Kurtz, Ute Willhoeft