242 search results - page 9 / 49 » Object-level Vertical Search |
SIAMDM
2008
13 years 7 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
IPL
2006
13 years 7 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
WG
1994
Springer
13 years 11 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
ICCV
2009
IEEE
15 years 17 days ago
2009
IEEE
The state-of-the art in visual object retrieval from large
databases allows to search millions of images on the object
level. Recently, complementary works have proposed systems
...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...