Sciweavers

2254 search results - page 321 / 451
» Computing the minimal covering set
Sort
View
175
Voted
CORR
2010
Springer
195views Education» more  CORR 2010»
15 years 6 months ago
Dynamic management of transactions in distributed real-time processing system
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
Y. Jayanta Singh, Yumnam Somananda Singh, Ashok Ga...
IJAIT
2006
121views more  IJAIT 2006»
15 years 6 months ago
An Efficient Feature Selection Algorithm for Computer-aided Polyp Detection
We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm 1) determines an appropriate piecewise...
Jiang Li, Jianhua Yao, Ronald M. Summers, Nicholas...
CPC
2004
98views more  CPC 2004»
15 years 6 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...
174
Voted
COGCOM
2011
213views more  COGCOM 2011»
15 years 19 days ago
Spatiotemporal Features for Action Recognition and Salient Event Detection
Although the mechanisms of human visual understanding remain partially unclear, computational models inspired by existing knowledge on human vision have emerged and applied to seve...
Konstantinos Rapantzikos, Yannis S. Avrithis, Stef...
CVPR
2011
IEEE
14 years 9 months ago
A Brute-Force Algorithm for Reconstructing a Scene from Two Projections
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences,...
Olof Enqvist, Fangyuan Jiang, Fredrik Kahl