175 search results - page 31 / 35 » max-cut and Containment Relations in Graphs |
CAGD
2006
13 years 7 months ago
2006
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
COMBINATORICS
2007
13 years 7 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
KES
2006
Springer
13 years 7 months ago
2006
Springer
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
TKDE
2002
13 years 7 months ago
2002
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...