Sciweavers

2609 search results - page 102 / 522
» Models for Global Constraint Applications
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 4 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
112
Voted
ASPDAC
2005
ACM
104views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Speed and voltage selection for GALS systems based on voltage/frequency islands
Due to increasing clock speeds and shrinking technologies, distributing a single global clock signal throughout a chip is becoming a difficult and challenging proposition. In this...
Koushik Niyogi, Diana Marculescu
141
Voted
QSIC
2005
IEEE
15 years 9 months ago
Fault-Based Testing of Database Application Programs with Conceptual Data Model
Database application programs typically contain program units that use SQL statements to manipulate records in database instances. Testing the correctness of data manipulation by ...
W. K. Chan, S. C. Cheung, T. H. Tse
CCGRID
2008
IEEE
15 years 10 months ago
Modeling "Just-in-Time" Communication in Distributed Real-Time Multimedia Applications
—The research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and archives. In re...
R. Yang, Robert D. van der Mei, D. Roubos, Frank J...
CPAIOR
2009
Springer
15 years 10 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...