Sciweavers

1651 search results - page 211 / 331
» Measuring the Complexity of Classification Problems
Sort
View
TKDE
2011
479views more  TKDE 2011»
14 years 4 months ago
Learning Semi-Riemannian Metrics for Semisupervised Feature Extraction
—Discriminant feature extraction plays a central role in pattern recognition and classification. Linear Discriminant Analysis (LDA) is a traditional algorithm for supervised feat...
Wei Zhang, Zhouchen Lin, Xiaoou Tang
SOFSEM
2000
Springer
15 years 1 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
HPDC
2007
IEEE
15 years 4 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely
SAS
2001
Springer
15 years 2 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 5 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach