2370 search results - page 124 / 474 » A Structured Set of Higher-Order Problems |
143
Voted
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
141
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
129
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
116
Voted
SIBGRAPI
2006
IEEE
15 years 9 months ago
2006
IEEE
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
115
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
As one of the earliest problems in computational biology, RNA secondary structure prediction (sometimes referred to as "RNA folding") problem has attracted attention agai...