5100 search results - page 252 / 1020 » The Linear Complexity of a Graph |
133
click to vote
DIS
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
136
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
120
click to vote
ICRA
1998
IEEE
15 years 8 months ago
1998
IEEE
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
135
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
153
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...