Sciweavers

2907 search results - page 2 / 582
» Presentations of Structures in Admissible Sets
Sort
View
RTCSA
2003
IEEE
13 years 10 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong
IGPL
1998
97views more  IGPL 1998»
13 years 5 months 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
CIKM
2008
Springer
13 years 7 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
ICASSP
2010
IEEE
13 years 5 months ago
Structured and incoherent parametric dictionary design
A new dictionary selection approach for sparse coding, called parametric dictionary design, has recently been introduced. The aim is to choose a dictionary from a class of admissi...
Mehrdad Yaghoobi, Laurent Daudet, Michael E. Davie...
AAAI
1998
13 years 6 months ago
Discovering Admissible Simultaneous Equations of Large Scale Systems
SSFisasystemtodiscoverthestructureofsimultaneous equations governing an objective process through experiments. SSF combined with another system SDS to discover a quantitative form...
Takashi Washio, Hiroshi Motoda