2612 search results - page 366 / 523 » Switching Graphs and Their Complexity |
151
click to vote
TOG
2002
15 years 4 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
132
click to vote
PR
2007
15 years 3 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
134
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
137
click to vote
SSIRI
2010
15 years 2 months ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
157
click to vote
WALCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...