289 search results - page 40 / 58 » A Framework for Visualising Large Graphs |
100
click to vote
TOG
2002
14 years 11 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...
100
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
GPCE
2007
Springer
15 years 3 months ago
2007
Springer
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
111
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...