8196 search results - page 308 / 1640 » Computational Modeling and Complexity Science |
158
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
151
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
152
click to vote
ISVD
2007
IEEE
16 years 28 days ago
2007
IEEE
We consider finite sets of oriented spheres in Rk−1 and, by interpreting such spheres as points in Rk , study the Voronoi diagrams they induce for several variants of distance ...
155
click to vote
GI
2007
Springer
16 years 24 days ago
2007
Springer
: In addition to the growing complexity of software systems, test effort takes increasing amounts of time and correspondingly more money. Testing costs may be reduced without compr...
159
click to vote
STACS
2007
Springer
16 years 23 days ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...