222 search results - page 41 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we address the problem of unsupervised Web data extraction. We show that unsupervised Web data extraction becomes feasible when supposing pages that are made up of r...
ECOOP
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
FPL
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...