Sciweavers

6202 search results - page 1173 / 1241
» Without Loss of Generality
Sort
View
114
Voted
CVIU
2007
193views more  CVIU 2007»
14 years 10 months ago
Interpretation of complex scenes using dynamic tree-structure Bayesian networks
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
Sinisa Todorovic, Michael C. Nechyba
JSAT
2008
99views more  JSAT 2008»
14 years 10 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
JSAT
2008
122views more  JSAT 2008»
14 years 10 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JUCS
2008
113views more  JUCS 2008»
14 years 10 months ago
What is Correctness of Security Protocols?
: As soon as major protocol flaws were discovered empirically -- a good luck that is not older than the early 1990s -- this title question came up to the world. It was soon realise...
Giampaolo Bella
JMLR
2006
389views more  JMLR 2006»
14 years 10 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...
« Prev « First page 1173 / 1241 Last » Next »