36 search results - page 2 / 8 » acsc 2005 |
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
The challenges faced by mobile and distributed applications include the ability to discover and negotiate for the resources required for execution. The NOMAD (Negotiated Object Mo...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
Cloth animation is a very expensive process in terms of computational cost, due to the flexible nature of cloth objects. Since wrinkles and smooth areas co-exist commonly in cloth...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
1 Service discovery protocols are used in distributed systems to locate services for clients. The services that are located as well as the clients requesting service are commonly a...