Sciweavers

2740 search results - page 115 / 548
» Typing the Specialization Interface
Sort
View
127
Voted
SIGIR
2012
ACM
13 years 3 months ago
Task complexity, vertical display and user interaction in aggregated search
Aggregated search is the task of blending results from specialized search services or verticals into the Web search results. While many studies have focused on aggregated search t...
Jaime Arguello, Wan-Ching Wu, Diane Kelly, Ashlee ...
TLCA
2007
Springer
15 years 7 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 4 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
95
Voted
EACL
1993
ACL Anthology
15 years 2 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
ENTCS
2002
90views more  ENTCS 2002»
15 years 18 days ago
Simple Easy Terms
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
Fabio Alessi, Stefania Lusin