Sciweavers

2089 search results - page 159 / 418
» A New Problem in String Searching
Sort
View
MFCS
2004
Springer
15 years 3 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
FSTTCS
2006
Springer
15 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
CONSTRAINTS
2008
182views more  CONSTRAINTS 2008»
14 years 10 months ago
Constraint Programming in Structural Bioinformatics
Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry...
Pedro Barahona, Ludwig Krippahl
TKDE
2008
136views more  TKDE 2008»
14 years 10 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
ECML
1998
Springer
15 years 2 months ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash