6103 search results - page 646 / 1221 » Multimedia Retrieval Algorithmics |
141
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
151
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
167
click to vote
RSKT
2009
Springer
16 years 28 days ago
2009
Springer
We bring two rough-set-based clustering algorithms into the framework of partially supervised clustering. A mechanism of partial supervision relying on either qualitative or quanti...
159
Voted
SKG
2006
IEEE
16 years 11 days ago
2006
IEEE
In this paper, we proposed the learning resource ontology(LRO) models to formally describe learning content and learning context, respectively. In addition to utilizing the models...
134
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...