1688 search results - page 243 / 338 » The Complexity of Rationalizing Matchings |
NSDI
2008
15 years 1 months ago
2008
Large-scale network services can consist of tens of thousands of machines running thousands of unique software configurations spread across hundreds of physical networks. Testing ...
103
click to vote
CPM
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
NSDI
2010
15 years 20 days ago
2010
Many Web services operate their own Web crawlers to discover data of interest, despite the fact that largescale, timely crawling is complex, operationally intensive, and expensive...
TRECVID
2008
15 years 20 days ago
2008
Run No. Run ID Run Description infMAP (%) training on TV08 data 1 IUPR-TV-M SIFT visual words with maximum entropy 6.1 2 IUPR-TV-MF SIFT with maximum entropy, fused with color+tex...
112
click to vote
SODA
1992
ACM
15 years 12 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...