11565 search results - page 2034 / 2313 » Computing Minimal Mappings |
210
click to vote
BALT
2006
15 years 10 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
171
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
174
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
179
click to vote
CF
2005
ACM
15 years 8 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
185
click to vote
CMSB
2008
Springer
15 years 8 months ago
2008
Springer
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...