Sciweavers

11231 search results - page 1975 / 2247
» Digging for Data Structures
Sort
View
132
Voted
ESOP
2007
Springer
15 years 7 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
141
Voted
EUROPAR
2007
Springer
15 years 7 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
139
Voted
SIGIR
2010
ACM
15 years 7 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
FSEN
2007
Springer
15 years 7 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
165
Voted
ERSHOV
2009
Springer
15 years 7 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
« Prev « First page 1975 / 2247 Last » Next »