Sciweavers

792 search results - page 76 / 159
» Measuring complexity by measuring structure and organization
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ICCV
2009
IEEE
1188views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Actionable Information in Vision
I propose a notion of visual information as the complexity not of the raw images, but of the images after the effects of nuisance factors such as viewpoint and illumination are dis...
Stefano Soatto
CVPR
2007
IEEE
16 years 8 months ago
The Effect of Pixel-Level Fusion on Object Tracking in Multi-Sensor Surveillance Video
This paper investigates the impact of pixel-level fusion of videos from visible (VIZ) and infrared (IR) surveillance cameras on object tracking performance, as compared to trackin...
Nedeljko Cvejic, Stavri G. Nikolov, Henry D. Knowl...
153
Voted
PVLDB
2010
110views more  PVLDB 2010»
15 years 4 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
194
Voted
ISCAS
2008
IEEE
287views Hardware» more  ISCAS 2008»
16 years 16 days ago
A high speed word level finite field multiplier using reordered normal basis
— Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered ...
Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmad...