53 search results - page 7 / 11 » Can Visibility Graphs be Represented Compactly |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
VLSID
2000
IEEE
13 years 12 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Analyzing videos of human activities involves not only
recognizing actions (typically based on their appearances),
but also determining the story/plot of the video. The storyline...
NIPS
2003
13 years 9 months ago
2003
Consider a number of moving points, where each point is attached to a joint of the human body and projected onto an image plane. Johannson showed that humans can effortlessly det...