Sciweavers

329 search results - page 35 / 66
» A note on the Hopf-Stiefel function
Sort
View
SDM
2011
SIAM
198views Data Mining» more  SDM 2011»
12 years 11 months ago
Exemplar-based Robust Coherent Biclustering
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
Kewei Tu, Xixiu Ouyang, Dingyi Han, Vasant Honavar
LICS
1996
IEEE
14 years 25 days ago
Completing Partial Combinatory Algebras With Unique Head-Normal Forms
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
ARSCOM
2008
103views more  ARSCOM 2008»
13 years 8 months ago
Estimating the number of graphs containing very long induced paths
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
Steven Butler
ENTCS
2008
106views more  ENTCS 2008»
13 years 8 months ago
Computability and Representations of the Zero Set
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Pieter Collins
FFA
2006
120views more  FFA 2006»
13 years 8 months ago
Enumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
Sergei Konyagin, Francesco Pappalardi