1170 search results - page 45 / 234 » How Fast Is Too Fast |
123
Voted
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
115
Voted
ETFA
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a fast line segment tracker which does not require any knowledge about the motion of the camera nor the structure of the observed scene. It runs on 320 x 240 pixel imag...
130
Voted
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
142
Voted
RTA
2007
Springer
15 years 8 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
113
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...