Sciweavers

684 search results - page 81 / 137
» A characterization of b-perfect graphs
Sort
View
WEBI
2007
Springer
15 years 6 months ago
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B...
SPAA
2003
ACM
15 years 5 months ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
ICALP
2003
Springer
15 years 5 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
KDD
2005
ACM
171views Data Mining» more  KDD 2005»
16 years 7 days ago
Application of kernels to link analysis
Abstract. The application of kernel methods to link analysis is explored. We argue that a family of kernels on graphs provides a unified perspective on the three measures proposed ...
Takahiko Ito, Masashi Shimbo, Taku Kudo, Yuji Mats...
LPAR
2007
Springer
15 years 6 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli