Sciweavers

123 search results - page 23 / 25
» Argument graphs and assumption-based argumentation
Sort
View
IPL
1998
119views more  IPL 1998»
13 years 9 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 4 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 4 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
RPTEL
2006
75views more  RPTEL 2006»
13 years 9 months ago
A Qualitative Analysis of Collaborative Knowledge Construction through Shared Representations
This paper takes one step towards addressing the question of how activity mediated by shared representations--notations that are manipulated by more than one person during a collab...
Daniel D. Suthers
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 10 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...