10271 search results - page 612 / 2055 » Computer Science |
181
click to vote
TCS
2008
15 years 7 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
178
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
204
click to vote
MKM
2004
Springer
16 years 18 days ago
2004
Springer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
180
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
189
click to vote
PLISP
1989
15 years 11 months ago
1989
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...