Sciweavers

279 search results - page 32 / 56
» Typability in Partial Applicative Structures
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
ER
2007
Springer
97views Database» more  ER 2007»
14 years 1 months ago
Towards Active Conceptual Modelling for Sudden Events
There are a number of issues for information systems which are required to collect data urgently that are not well accommodated by current conceptual modelling methodologies and a...
John F. Roddick, Aaron Ceglar, Denise de Vries
BMCBI
2010
129views more  BMCBI 2010»
13 years 7 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki
ICFP
2006
ACM
14 years 7 months ago
Algebraic fusion of functions with an accumulating parameter and its improvement
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
Shin-ya Katsumata, Susumu Nishimura
ISSRE
2002
IEEE
14 years 14 days ago
Fault Contribution Trees for Product Families
Software Fault Tree Analysis (SFTA) provides a structured way to reason about the safety or reliability of a software system. As such, SFTA is widely used in missioncritical appli...
Dingding Lu, Robyn R. Lutz