Sciweavers

1419 search results - page 53 / 284
» A Characterization of Constructive Dimension
Sort
View
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 1 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
JSAI
2005
Springer
15 years 5 months ago
Representing Information Structure in a Formal Grammar of Danish
This paper presents a proposal for the integration of information structure in a unification-based grammar of Danish. Three information structure features – topic, focus and bac...
Patrizia Paggio
ORL
2008
73views more  ORL 2008»
14 years 12 months ago
Polytopes and arrangements: Diameter and curvature
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
Antoine Deza, Tamás Terlaky, Yuriy Zinchenk...
DATAMINE
1998
145views more  DATAMINE 1998»
14 years 11 months ago
A Tutorial on Support Vector Machines for Pattern Recognition
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
Christopher J. C. Burges
JAIR
2010
94views more  JAIR 2010»
14 years 10 months ago
Which Clustering Do You Want? Inducing Your Ideal Clustering with Minimal Feedback
While traditional research on text clustering has largely focused on grouping documents by topic, it is conceivable that a user may want to cluster documents along other dimension...
Sajib Dasgupta, Vincent Ng