182 search results - page 22 / 37 » Extremal Problems For Transversals In Graphs With Bounded De... |
106
click to vote
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
110
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
112
click to vote
STOC
2006
ACM
16 years 2 days ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...