Sciweavers

1018 search results - page 115 / 204
» Generative unbinding of names
Sort
View
HASKELL
2007
ACM
14 years 1 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
ATAL
2009
Springer
13 years 10 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
MM
2010
ACM
204views Multimedia» more  MM 2010»
13 years 9 months ago
Crew: cross-modal resource searching by exploiting wikipedia
In Web 2.0, users have generated and shared massive amounts of resources in various media formats, such as news, blogs, audios, photos and videos. The abundance and diversity of t...
Chen Liu, Beng Chin Ooi, Anthony K. H. Tung, Dongx...
BMCBI
2008
173views more  BMCBI 2008»
13 years 9 months ago
Extraction of semantic biomedical relations from text using conditional random fields
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...
Markus Bundschus, Mathäus Dejori, Martin Stet...
BMCBI
2008
144views more  BMCBI 2008»
13 years 9 months ago
PDTD: a web-accessible protein database for drug target identification
Background: Target identification is important for modern drug discovery. With the advances in the development of molecular docking, potential binding proteins may be discovered b...
Zhenting Gao, Honglin Li, Hailei Zhang, Xiaofeng L...