3091 search results - page 116 / 619 » The Color Between Two Others |
128
Voted
ICTAI
2006
IEEE
15 years 9 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
151
Voted
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
- Robot companions need to be able to constantly acquire knowledge about new objects for instance in order to detect them in the environment. This ability is necessary since it is ...
124
Voted
UIST
2006
ACM
15 years 9 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
137
click to vote
INFOVIS
2005
IEEE
15 years 9 months ago
2005
IEEE
Parallel Coordinates are a powerful method for visualizing multidimensional data, however, with large data sets they can become cluttered and difficult to read. On the other hand...
123
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...