4137 search results - page 480 / 828 » On the number of matchings of a tree |
171
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
224
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
182
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
193
click to vote
EUROPAR
2005
Springer
16 years 11 days ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
172
Voted
WINE
2005
Springer
16 years 10 days ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...