Sciweavers

2310 search results - page 405 / 462
» Coloring Random Graphs
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 8 months ago
A data mining approach to modeling relationships among categories in image collection
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
Ruofei Zhang, Zhongfei (Mark) Zhang, Sandeep Khanz...
POPL
2003
ACM
14 years 8 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
INFOCOM
2007
IEEE
14 years 2 months ago
Network Coding in a Multicast Switch
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
Jay Kumar Sundararajan, Muriel Médard, MinJ...
RAID
2005
Springer
14 years 1 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...