Sciweavers

22 search results - page 2 / 5
» Periodicity based decidable classes in a first order timed l...
Sort
View
CSL
2009
Springer
13 years 9 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 2 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
TSMC
2008
102views more  TSMC 2008»
13 years 5 months ago
Generalized Cost-Function-Based Forecasting for Periodically Measured Nonstationary Traffic
Abstract-- In this paper, we address the issue of forecasting for periodically measured nonstationary traffic based on statistical time series modeling. Often with time series base...
Balaji Krithikaivasan, Yong Zeng, Deep Medhi
IPM
2002
106views more  IPM 2002»
13 years 5 months ago
A feature mining based approach for the classification of text documents into disjoint classes
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
Salvador Nieto Sánchez, Evangelos Triantaph...
SEFM
2009
IEEE
14 years 13 hour ago
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
Davide Bresolin, Valentin Goranko, Angelo Montanar...