6615 search results - page 62 / 1323 » Indexing Multiple Sets |
ARSCOM
2007
15 years 2 hour ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
202
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
DIAGRAMS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
FLAIRS
2006
15 years 1 months ago
2006
The world wide web has a wealth of information that is related to almost any text classification task. This paper presents a method for mining the web to improve text classificati...
122
click to vote
ADAC
2010
14 years 11 months ago
2010
Abstract We propose a procedure based on a latent variable model for the comparison of two partitions of different units described by the same set of variables. The null hypothesis...