8699 search results - page 1420 / 1740 » Elements of the Theory of Computation |
228
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
230
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
222
click to vote
ICDT
2012
ACM
13 years 9 months ago
2012
ACM
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
185
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper, a new method of feature extraction with rotation invariant property is presented. One of the main contributions of this study is that a rotation invariant signature...
158
click to vote
ICIP
1998
IEEE
16 years 8 months ago
1998
IEEE
We present a novel formulation for B-spline snakes that can be used as a tool for fast and intuitive contour outlining. The theory is implemented in a platform independent JAVA in...