1605 search results - page 125 / 321 » On Partitional Labelings of Graphs |
162
click to vote
IJCAI
2007
15 years 7 months ago
2007
An “active learning system” will sequentially decide which unlabeled instance to label, with the goal of efficiently gathering the information necessary to produce a good cla...
138
click to vote
EJC
2006
15 years 6 months ago
2006
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
167
click to vote
AAIM
2007
Springer
16 years 16 days ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
194
click to vote
MVA
2007
15 years 7 months ago
2007
In this paper we propose an image segmentation algorithm that combines region merging with spectral-based techniques. An initial partitioning of the image into primitive regions i...
209
click to vote
DLOG
2011
14 years 10 months ago
2011
Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked da...