79 search results - page 7 / 16 » The Last Fraction of a Fractional Conjecture |
ACS
2004
13 years 7 months ago
2004
Inthis article westudy the fundamental category (Goubault and Raussen, 2002 Goubault, 2002) of a partially ordered topological space (Nachbin, 1965 Johnstone, 1982), as arising in ...
SIAMDM
2010
13 years 2 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
FTTCS
2006
13 years 7 months ago
2006
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...