Sciweavers

528 search results - page 24 / 106
» Degrees of categoricity of computable structures
Sort
View
VIS
2004
IEEE
148views Visualization» more  VIS 2004»
14 years 9 months ago
Detection and Visualization of Anomalous Structures in Molecular Dynamics Simulation Data
In this article we explore techniques to detect and visualize features in data from molecular dynamics (MD) simulations. Although the techniques proposed are general, we focus on ...
John Wilkins, Kaden Hazzard, Raghu Machiraju, Same...
SIGIR
2002
ACM
13 years 8 months ago
Predicting category accesses for a user in a structured information space
In a categorized information space, predicting users' information needs at the category level can facilitate personalization, caching and other topic-oriented services. This ...
Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
IPPS
2003
IEEE
14 years 1 months ago
On the Appropriateness of Commodity Operating Systems for Large-Scale, Balanced Computing Systems
In the past five years, we have been involved in the design and development of Cplanttm . An important goal was to take advantages of commodity approaches wherever possible. In p...
Ron Brightwell, Arthur B. Maccabe, Rolf Riesen
JMLR
2008
148views more  JMLR 2008»
13 years 8 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
APAL
2007
104views more  APAL 2007»
13 years 8 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi