Sciweavers

4103 search results - page 10 / 821
» Some results on the Collatz problem
Sort
View
COMMA
2010
13 years 2 months ago
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
Ringo Baumann, Gerhard Brewka
BIRTHDAY
2009
Springer
14 years 2 months ago
Properly Coloured Cycles and Paths: Results and Open Problems
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
Gregory Gutin, Eun Jung Kim
DAM
2006
116views more  DAM 2006»
13 years 7 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
SIGKDD
2010
111views more  SIGKDD 2010»
13 years 2 months ago
Unexpected results in automatic list extraction on the web
The discovery and extraction of general lists on the Web continues to be an important problem facing the Web mining community. There have been numerous studies that claim to autom...
Tim Weninger, Fabio Fumarola, Rick Barber, Jiawei ...
FSTTCS
2008
Springer
13 years 8 months ago
Some Sieving Algorithms for Lattice Problems
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
Vikraman Arvind, Pushkar S. Joglekar