2512 search results - page 466 / 503 » Learning from Highly Structured Data by Decomposition |
SI3D
2005
ACM
15 years 3 months ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
BMCBI
2005
14 years 9 months ago
2005
Background: Protein domains have long been an ill-defined concept in biology. They are generally described as autonomous folding units with evolutionary and functional independenc...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
100
click to vote
GG
2008
Springer
14 years 10 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
107
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Recently, a number of algorithms have been proposed to obtain hierarchical structures — so-called folksonomies — from social tagging data. Work on these algorithms is in part ...