125
click to vote
TLCA
15 years 6 months ago
2007 Springer 
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...
147
click to vote
KSEM
15 years 6 months ago
2007 Springer 
Traditional phrase matching approaches, which can discover documents containing exactly the same phrases, fail to detect documents including phrases that are semantically relevant,...
131
Voted
ACSC
15 years 6 months ago
2007 IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
ACSC
15 years 6 months ago
2007 IEEE 
The design guideline avoid dependency cycles among modules was ļ¬rst alluded to by Parnas in 1978. Many tools have since been built to detect cyclic dependencies among a programā...
124
click to vote
IMECS
15 years 1 months ago
2007
Abstract Previously, we have proposed two recommendation systems, the Context-aware Information Filtering (C-IF) and Context-aware Collaborative Filtering (C-CF), both of which ar...
|
Theoretical Computer Science