Sciweavers

146 search results - page 13 / 30
» A new characterization of P6-free graphs
Sort
View
WEBI
2007
Springer
14 years 1 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...
ICALP
2003
Springer
14 years 21 days 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...
DIMVA
2006
13 years 9 months ago
Detecting Self-mutating Malware Using Control-Flow Graph Matching
Next generation malware will by be characterized by the intense use of polymorphic and metamorphic techniques aimed at circumventing the current malware detectors, based on pattern...
Danilo Bruschi, Lorenzo Martignoni, Mattia Monga
ISPASS
2009
IEEE
14 years 2 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
WG
1998
Springer
13 years 11 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano