Sciweavers

2354 search results - page 327 / 471
» Assignment Problems
Sort
View
NIPS
2003
15 years 6 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
COLING
1992
15 years 6 months ago
A Generalized Greibach Normal Form for Definite Clause Grammars
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for...
Marc Dymetman
FSKD
2008
Springer
123views Fuzzy Logic» more  FSKD 2008»
15 years 6 months ago
PartSpan: Parallel Sequence Mining of Trajectory Patterns
The trajectory pattern mining problem has recently attracted increasing attention. This paper precisely addresses the parallel mining problem of trajectory patterns as well as the...
Shaojie Qiao, Changjie Tang, Shucheng Dai, Mingfan...
153
Voted
ICML
2010
IEEE
15 years 6 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
118
Voted
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 5 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap