Sciweavers

716 search results - page 71 / 144
» Rule Formats for Timed Processes
Sort
View
MM
1997
ACM
104views Multimedia» more  MM 1997»
13 years 12 months ago
A Framework for Generating Adaptable Hypermedia Documents
Being able to author a hypermedia document once for presentation under a wide variety of potential circumstances requires that it be stored in a manner that is adaptable to these ...
Lloyd Rutledge, Jacco van Ossenbruggen, Lynda Hard...
ASWC
2009
Springer
13 years 5 months ago
SHARE: A Semantic Web Query Engine for Bioinformatics
Driven by the goal of automating data analyses in the field of bioinformatics, SHARE (Semantic Health and Research Environment) is a specialized SPARQL engine that resolves queries...
Benjamin P. Vandervalk, E. Luke McCarthy, Mark D. ...
LNCS
1991
13 years 11 months ago
A Flexible Parser for a Linguistic Development Environment
We describe the parser of LEU/2, the Linguistic Experimentation Environment of the LILOG project. The parser is designed to support and encourage experimentation with different gr...
Gregor Erbach
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 7 months ago
Document stream clustering: experimenting an incremental algorithm and AR-based tools for highlighting dynamic trends
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
Alain Lelu, Martine Cadot, Pascal Cuxac
MICAI
2000
Springer
13 years 11 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green