1871 search results - page 121 / 375 » The Ephemeral Pairing Problem |
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
EUROMICRO
2004
IEEE
15 years 3 months ago
2004
IEEE
The paper summarizes three years of experience of introducing agile practices in academic environments. The perceptions of students from four different academic programs (Diploma,...
FLAIRS
2007
15 years 1 months ago
2007
The quality of ontologies (QoO) is increasingly becoming a research issue on the Semantic Web. Ontology users may have difficulties locating the proper concepts in large ontologie...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
105
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...