Sciweavers

209 search results - page 10 / 42
» The Computational Complexity of Weak Saddles
Sort
View
ECCV
2002
Springer
14 years 9 months ago
Building Roadmaps of Local Minima of Visual Models
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
Cristian Sminchisescu, Bill Triggs
AVBPA
2003
Springer
133views Biometrics» more  AVBPA 2003»
13 years 11 months ago
LUT-Based Adaboost for Gender Classification
There are two main approaches to the problem of gender classification, Support Vector Machines (SVMs) and Adaboost learning methods, of which SVMs are better in correct rate but ar...
Bo Wu, Haizhou Ai, Chang Huang
TSMC
2008
172views more  TSMC 2008»
13 years 7 months ago
AdaBoost-Based Algorithm for Network Intrusion Detection
Abstract--Network intrusion detection aims at distinguishing the attacks on the Internet from normal use of the Internet. It is an indispensable part of the information security sy...
Weiming Hu, Wei Hu, Stephen J. Maybank
ICALP
2009
Springer
14 years 7 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
CHI
2005
ACM
14 years 7 months ago
Single complex glyphs versus multiple simple glyphs
Designers of information visualization systems have the choice to present information in a single integrated view or in multiple views. In practice, there is a continuum between t...
Beth Yost, Chris North