Sciweavers

1605 search results - page 125 / 321
» On Partitional Labelings of Graphs
Sort
View
IJCAI
2007
14 years 5 days ago
Optimistic Active-Learning Using Mutual Information
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...
Yuhong Guo, Russell Greiner
EJC
2006
13 years 10 months ago
Poset edge-labellings and left modularity
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 ...
Peter McNamara, Hugh Thomas
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 5 months ago
Probe Matrix Problems: Totally Balanced Matrices
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 ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
MVA
2007
189views Computer Vision» more  MVA 2007»
14 years 5 days ago
Image Segmentation Using Region Merging Combined with a Multi-class Spectral Method
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...
Fernando C. Monteiro, Aurélio C. Campilho
DLOG
2011
13 years 2 months ago
Integrity Constraints for Linked Data
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...
Alan Jeffrey, Peter F. Patel-Schneider