715 search results - page 75 / 143 » On graphs with subgraphs having large independence numbers |
110
click to vote
WADS
2001
Springer
15 years 4 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
121
click to vote
IWCIA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
118
click to vote
IJCNN
2000
IEEE
15 years 4 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
NAACL
2003
15 years 1 months ago
2003
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...
133
click to vote
COCO
1997
Springer
15 years 4 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...