Sciweavers

2372 search results - page 383 / 475
» Probabilistic calling context
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 8 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
EJC
2008
13 years 8 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
ALMOB
2006
97views more  ALMOB 2006»
13 years 8 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
EOR
2008
90views more  EOR 2008»
13 years 8 months ago
Quality of service statistics over heterogeneous networks: Analysis and applications
Heterogeneous wireless/wired networks and ubiquitous environments are gaining ever more attention by research community. To properly control and manage such puzzles a deep knowled...
Alessio Botta, Antonio Pescapè, Giorgio Ven...
CSCL
2006
109views more  CSCL 2006»
13 years 8 months ago
Supporting synchronous collaborative learning: A generic, multi-dimensional model
Future CSCL technologies are described by the community as flexible, tailorable, negotiable, and appropriate for various collaborative settings, conditions and contexts. This paper...
Jacques Lonchamp