595 search results - page 61 / 119 » Incidence of |
154
click to vote
DCG
1999
15 years 5 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
149
click to vote
TC
1998
15 years 5 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
144
click to vote
SIAMCOMP
2002
15 years 5 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
168
Voted
MOR
2007
15 years 5 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
161
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract— We describe here our proposed method to investigate the sliding motion of a soft fingertip in the dexterous manipulation. This paper focuses on analyzing dynamic slidi...