Sciweavers

1888 search results - page 112 / 378
» Proof theory and computational analysis
Sort
View
105
Voted
ICIP
2010
IEEE
14 years 10 months ago
The 2D orientation is unique through principal moments analysis
When comparing 2D shapes, a key issue is their normalization. Translation and scale are easily taken care of by removing the mean and normalizing the energy. However, defining and...
João F. P. Crespo, Pedro M. Q. Aguiar
HICSS
2003
IEEE
167views Biometrics» more  HICSS 2003»
15 years 5 months ago
Discovering Group Interaction Patterns in a Teachers Professional Community
Managers and group leaders of a community may not have enough information to help them direct the community development. In this paper, we adopt social network analysis, graph the...
Fu-ren Lin, Chun-Hung Chen, Kuo-Lung Tsai
108
Voted
CCS
2006
ACM
15 years 4 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang
109
Voted
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 20 days ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
118
Voted
JSYML
2007
100views more  JSYML 2007»
15 years 13 days ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore