242 search results - page 43 / 49 » Object-level Vertical Search |
121
Voted
NETWORKS
2010
15 years 1 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
159
Voted
ISAAC
2010
Springer
15 years 15 days ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
129
Voted
ICDAR
2009
IEEE
15 years 10 days ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
120
Voted
IEAAIE
1994
Springer
15 years 6 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
131
Voted
SIGIR
2010
ACM
15 years 6 months ago
2010
ACM
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...