Sciweavers

4542 search results - page 606 / 909
» Design patterns for data structures
Sort
View
ICFP
2009
ACM
16 years 7 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
SIGIR
2006
ACM
16 years 18 days ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
CGI
1998
IEEE
15 years 11 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
BMCBI
2008
96views more  BMCBI 2008»
15 years 6 months ago
A PATO-compliant zebrafish screening database (MODB): management of morpholino knockdown screen information
Background: The zebrafish is a powerful model vertebrate amenable to high throughput in vivo genetic analyses. Examples include reverse genetic screens using morpholino knockdown,...
Michelle N. Knowlton, Tongbin Li, Yongliang Ren, B...
MIDDLEWARE
2010
Springer
15 years 5 months ago
FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...
Kyungbaek Kim, Sharad Mehrotra, Nalini Venkatasubr...