4212 search results - page 601 / 843 » On Compressible Pairings and Their Computation |
159
click to vote
NA
2008
15 years 6 months ago
2008
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
152
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
207
click to vote
SMA
2008
ACM
15 years 6 months ago
2008
ACM
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
168
click to vote
TOG
2008
15 years 6 months ago
2008
We present a new discrete velocity-level formulation of frictional contact dynamics that reduces to a pair of coupled projections and introduce a simple fixed-point property of th...
172
click to vote
TCS
1998
15 years 6 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](http://sciweavers.com/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...