198 search results - page 16 / 40 » On Extremal Cases of Hopcroft's Algorithm |
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
UCS
2007
Springer
14 years 2 months ago
2007
Springer
In many Ubicomp scenarios tiny wireless embedded sensor devices are used, and devices often collaborate to accomplish a common goal. This paper presents a group formation method de...
AINA
2004
IEEE
14 years 6 days ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
IJAR
2010
13 years 7 months ago
2010
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
CAGD
2010
13 years 5 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...