5316 search results - page 364 / 1064 » Which Search Problems Are Random |
205
Voted
JDCTA
2010
15 years 2 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
276
click to vote
TMM
2010
15 years 2 months ago
2010
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
215
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
206
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
228
click to vote
JAIR
2006
15 years 7 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...