Sciweavers

2412 search results - page 303 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
TELSYS
2002
73views more  TELSYS 2002»
15 years 3 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
124
Voted
CORR
2010
Springer
221views Education» more  CORR 2010»
15 years 28 days ago
Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nas...
180
Voted
CVIU
2011
14 years 7 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
138
Voted
TIP
2008
108views more  TIP 2008»
15 years 3 months ago
Design of Linear Equalizers Optimized for the Structural Similarity Index
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...
Sumohana S. Channappayya, Alan C. Bovik, Constanti...
148
Voted
IPSN
2011
Springer
14 years 7 months ago
Localising speech, footsteps and other sounds using resource-constrained devices
While a number of acoustic localisation systems have been proposed over the last few decades, these have typically either relied on expensive dedicated microphone arrays and works...
Yukang Guo, Mike Hazas