2503 search results - page 313 / 501 » A study of 3-arc graphs |
175
click to vote
INFOCOM
2009
IEEE
16 years 17 days ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
170
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
158
click to vote
EUROCOLT
1995
Springer
15 years 9 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
266
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
147
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...