Sciweavers

840 search results - page 94 / 168
» The Complexity of the Extended GCD Problem
Sort
View
ENTCS
2002
77views more  ENTCS 2002»
13 years 9 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
CMOT
1999
143views more  CMOT 1999»
13 years 8 months ago
Structural Learning: Attraction and Conformity in Task-Oriented Groups
This study extends previous research that showed how informal social sanctions can backfire when members prefer friendship over enforcement of group norms. We use a type of neural...
James A. Kitts, Michael W. Macy, Andreas Flache
MVA
2002
132views Computer Vision» more  MVA 2002»
13 years 8 months ago
Constituting Feasible Folding Operation Using Incomplete Crease Information
This paper proposes a novel approach to constituting all the feasible ways of folding, based on crease infomation obtained from an image of illustrations of general origami drill ...
Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe
PVLDB
2008
123views more  PVLDB 2008»
13 years 8 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
DLOG
2010
13 years 7 months ago
Automata-Based Abduction for Tractable Diagnosis
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
Thomas Hubauer, Steffen Lamparter, Michael Pirker