Sciweavers

184 search results - page 26 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
DAWAK
2000
Springer
14 years 29 days ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
CCE
2005
13 years 8 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 9 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
BMCBI
2007
144views more  BMCBI 2007»
13 years 8 months ago
Spectral estimation in unevenly sampled space of periodically expressed microarray time series data
Background: Periodogram analysis of time-series is widespread in biology. A new challenge for analyzing the microarray time series data is to identify genes that are periodically ...
Alan Wee-Chung Liew, Jun Xian, Shuanhu Wu, David K...
GI
2004
Springer
14 years 2 months ago
Type Safe Programming of XML-based Applications
: There is an emerging amount of software for generating and manipulating XML documents. This paper addresses the problem of guaranteeing the validity of dynamically generated XML ...
Martin Kempa, Volker Linnemann