Sciweavers

3032 search results - page 481 / 607
» Complexity of sequences and dynamical systems
Sort
View
IGPL
1998
97views more  IGPL 1998»
15 years 17 days ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
JBI
2002
126views Bioinformatics» more  JBI 2002»
15 years 17 days ago
Characteristic attributes in cancer microarrays
Rapid advances in genome sequencing and gene expression microarray technologies are providing unprecedented opportunities to identify specific genes involved in complex biological...
Indra Neil Sarkar, Paul J. Planet, T. E. Bael, S. ...
SAC
2008
ACM
15 years 11 days ago
Aggregation languages for moving object and places of interest
We address aggregate queries over GIS data and moving object data, where non-spatial information is stored in a data warehouse. We propose a formal data model and query language t...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
MICS
2010
123views more  MICS 2010»
14 years 11 months ago
On the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
SSIRI
2010
14 years 11 months ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit