Sciweavers

2294 search results - page 280 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
DAM
2011
15 years 1 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
CIKM
2011
Springer
14 years 6 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
Mo Zhou, Yifan Pan, Yuqing Wu
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 12 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 11 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
IS
2007
15 years 6 months ago
Improving process models by discovering decision points
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
Sharmila Subramaniam, Vana Kalogeraki, Dimitrios G...