Sciweavers

2356 search results - page 433 / 472
» Characterizations of postman sets
Sort
View
116
Voted
ICALP
2003
Springer
15 years 7 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
PASTE
2010
ACM
15 years 7 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
15 years 6 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
160
Voted
ECOOP
2001
Springer
15 years 6 months ago
Feature Interaction and Composition Problems in Software Product Lines
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
Silva Robak, Bogdan Franczyk
125
Voted
ICSE
2001
IEEE-ACM
15 years 6 months ago
Workshop on Software Engineering and Mobility
Mobility is redefining the hardware and software fabric of distributed systems. Wireless communication allows network hosts to participate in a distributed computation while on t...
Gruia-Catalin Roman, Gian Pietro Picco