Sciweavers

2165 search results - page 347 / 433
» cases 2005
Sort
View
WDAG
2005
Springer
157views Algorithms» more  WDAG 2005»
15 years 3 months ago
(Almost) All Objects Are Universal in Message Passing Systems
d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
WEBI
2005
Springer
15 years 3 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
WER
2005
Springer
15 years 3 months ago
Requirement Elicitation Based on Goals with Security and Privacy Policies in Electronic Commerce
This paper describes a method for requirements elicitation based on goals for electronic commerce systems in agreement with security and privacy polices of the site. The method in...
Simara Vieira da Rocha, Zair Abdelouahab, Eduardo ...
WG
2005
Springer
15 years 3 months ago
Induced Subgraphs of Bounded Degree and Bounded Treewidth
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
Prosenjit Bose, Vida Dujmovic, David R. Wood
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 3 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