2907 search results - page 424 / 582 » Trust analysis with clustering |
185
click to vote
MST
2010
15 years 5 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
172
click to vote
TASLP
2010
15 years 4 months ago
2010
—We consider representing a short temporal fragment of musical audio as a dynamic texture, a model of both the timbral and rhythmical qualities of sound, two of the important asp...
214
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
209
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Many computer vision algorithms such as object tracking and event detection assume that a background model of the scene under analysis is known. However, in many practical circums...
176
click to vote
CIDU
2010
15 years 4 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...