7228 search results - page 352 / 1446 » From Algorithmic to Subjective Randomness |
143
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
154
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
168
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
154
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
134
Voted
WWW
2008
ACM
16 years 5 months ago
2008
ACM
We study in this paper the Web forum crawling problem, which is a very fundamental step in many Web applications, such as search engine and Web data mining. As a typical user-crea...