Sciweavers

901 search results - page 159 / 181
» On Anonymization of String Data
Sort
View
MFCS
2004
Springer
15 years 6 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 6 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
JCDL
2003
ACM
101views Education» more  JCDL 2003»
15 years 6 months ago
Bibliographic Attribute Extraction from Erroneous References Based on a Statistical Model
In this paper, we propose a method for extracting bibliographic attributes from reference strings captured using Optical Character Recognition (OCR) and an extended hidden Markov ...
Atsuhiro Takasu
PPOPP
2003
ACM
15 years 6 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
CICLING
2003
Springer
15 years 6 months ago
Positive Grammar Checking: A Finite State Approach
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
Sylvana Sofkova Hashemi, Robin Cooper, Robert Ande...