Sciweavers

41 search results - page 7 / 9
» cpc 2006
Sort
View
CPC
2006
110views more  CPC 2006»
13 years 6 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
ACCV
2006
Springer
13 years 12 months ago
A Method for Calibrating a Motorized Object Rig
Abstract. Object Movies (OMs) have been successfully used in many applications. However, the techniques for acquiring OMs still need to be improved if high-quality and efficient OM...
Pang-Hung Huang, Yu-Pao Tsai, Wan-Yen Lo, Sheng-We...
AIRS
2006
Springer
13 years 9 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
JSYML
2000
97views more  JSYML 2000»
13 years 5 months ago
Weakly Algebraizable Logics
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...
Janusz Czelakowski, Ramon Jansana
APAL
2006
107views more  APAL 2006»
13 years 6 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek