Sciweavers

2517 search results - page 433 / 504
» Specifying Weak Sets
Sort
View
140
Voted
IIE
2007
125views more  IIE 2007»
15 years 5 months ago
Should LOGO Keep Going FORWARD 1?
LOGO has been evolving in incremental steps for 40 years. This has resulted in steady progress but some regions of the space of all programming languages for children cannot be re...
Ken Kahn
PRESENCE
2006
102views more  PRESENCE 2006»
15 years 5 months ago
The Usability of Collaborative Virtual Environments and Methods for the Analysis of Interaction
This paper describes two methods for analyzing interactions in collaborative virtual environments (CVEs): one whereby quantitative data are captured, interaction is categorized in...
Ralph Schroeder, Ilona Heldal, Jolanda G. Tromp
BMCBI
2005
95views more  BMCBI 2005»
15 years 5 months ago
Oligomeric protein structure networks: insights into protein-protein interactions
Background: Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the princip...
K. V. Brinda, Saraswathi Vishveshwara
134
Voted
ENTCS
2002
113views more  ENTCS 2002»
15 years 5 months ago
A monadic approach to polycategories
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
Jürgen Koslowski
145
Voted
JSYML
1998
61views more  JSYML 1998»
15 years 5 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah