144 search results - page 24 / 29 » Path extendability of claw-free graphs |
101
click to vote
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
102
click to vote
ALGORITHMICA
2006
14 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
111
click to vote
SIGGRAPH
1998
ACM
15 years 1 months ago
1998
ACM
Virtual environment research has focused on interactive image generation and has largely ignored acoustic modeling for spatialization of sound. Yet, realistic auditory cues can co...
PR
2011
14 years 4 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
FPL
2009
Springer
15 years 2 months ago
2009
Springer
We leverage properties of the logic synthesis netlist to define both a logic element architecture and an associated technology mapping algorithm that together provide improved lo...