Sciweavers

845 search results - page 92 / 169
» Complexity Dimensions and Learnability
Sort
View
SERP
2004
15 years 1 months ago
Run-Time Cohesion Metrics: An Empirical Investigation
Cohesion is one of the fundamental measures of the 'goodness' of a software design. The most accepted and widely studied object-oriented cohesion metric is Chidamber and...
Áine Mitchell, James F. Power
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 1 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
ISMB
1993
15 years 1 months ago
Representation for Discovery of Protein Motifs
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
Darrell Conklin, Suzanne Fortier, Janice I. Glasgo...
ICASSP
2010
IEEE
15 years 1 days ago
Sparsity-cognizant overlapping co-clustering for behavior inference in social networks
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
Hao Zhu, Gonzalo Mateos, Georgios B. Giannakis, Ni...
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
14 years 12 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...