903 search results - page 15 / 181 » Non-well-founded trees in categories |
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Bag-of-visual Words (BoW) image representation is getting popular in computer vision and multimedia communities. However, experiments show that the traditional BoW representation ...
155
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
102
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
AVI
2008
15 years 2 months ago
2008
In many applications transactions between the elements of an information hierarchy occur over time. For example, the product offers of a department store can be organized into pro...
106
click to vote
INFOSCALE
2007
ACM
15 years 1 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...