Sciweavers

2659 search results - page 115 / 532
» Do we mean the same
Sort
View
ICML
1996
IEEE
16 years 5 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
144
Voted
ANSS
2003
IEEE
15 years 10 months ago
A Simulation Study of the Proactive Server Roaming for Mitigating Denial of Service Attacks
The main goal of the NETSEC project is to design and implement a framework for mitigating the effects of the node-based and link-based DoS attacks. Our strategy employs three lin...
Chatree Sangpachatanaruk, Sherif M. Khattab, Taieb...
DBPL
1999
Springer
122views Database» more  DBPL 1999»
15 years 9 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
CIE
2008
Springer
15 years 6 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
CANDC
2005
ACM
15 years 4 months ago
Assessment of chemical libraries for their druggability
High throughput virtual screening is acknowledged as the initial means for identifying hit compounds that will be eventually transformed to leads or drug candidates. To improve qu...
Suzanne W. Sirois, George Hatzakis, Dongqing Wei, ...