Sciweavers

725 search results - page 120 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 1 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
IJCAI
2003
14 years 11 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
ERCIM
2008
130views more  ERCIM 2008»
14 years 9 months ago
Mediated Collaborative Learning
Information and Communication Technologies facilitate the emergence of new contexts and practices of learning that educational institutions have to adapt to their pedagogical disc...
Kostas Pentikousis, Carmen Martinez-Carrillo
76
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 9 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CORR
2002
Springer
101views Education» more  CORR 2002»
14 years 9 months ago
Semantic Component Composition
Building complex software systems necessitates the use of component-based architectures. In theory, of the set of components needed for a design, only some small portion of them ar...
Joseph Kiniry