Sciweavers

1772 search results - page 163 / 355
» Classifying Problems into Complexity Classes
Sort
View
PRL
2010
209views more  PRL 2010»
15 years 1 months ago
Efficient update of the covariance matrix inverse in iterated linear discriminant analysis
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
Jan Salmen, Marc Schlipsing, Christian Igel
HICSS
2010
IEEE
487views Biometrics» more  HICSS 2010»
16 years 1 months ago
A Survey of Game Theory as Applied to Network Security
Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two de...
Sankardas Roy, Charles Ellis, Sajjan Shiva, Dipank...
COMPGEOM
2005
ACM
15 years 8 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
WIA
2005
Springer
15 years 12 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
16 years 6 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold