Sciweavers

32 search results - page 4 / 7
» Persuasive, Authorative and Topical Answers for Complex Ques...
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
DKE
2002
137views more  DKE 2002»
13 years 7 months ago
Reasoning for Web document associations and its applications in site map construction
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...
K. Selçuk Candan, Wen-Syan Li
COCOON
2009
Springer
14 years 2 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
ICDE
2008
IEEE
149views Database» more  ICDE 2008»
14 years 9 months ago
Monitoring Network Evolution using MDL
Given publication titles and authors, what can we say about the evolution of scientific topics and communities over time? Which communities shrunk, which emerged, and which split, ...
Jure Ferlez, Christos Faloutsos, Jure Leskovec, Du...
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
14 years 7 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao