Sciweavers

4117 search results - page 313 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ICMCS
2005
IEEE
114views Multimedia» more  ICMCS 2005»
16 years 12 days ago
A User-Oriented Multimodal-Interface Framework for General Content-Based Multimedia Retrieval
A user-oriented multimodal interface (MMI) framework is proposed. Considering the complexities of media connotations and uncertainties of the user’s demands, content-based retri...
Jinchang Ren, Theodore Vlachos, Vasileios Argyriou
ICSM
2005
IEEE
16 years 12 days ago
Towards a Framework for Testing Structural Source-Code Regularities
As size and complexity of software systems increase, preserving the design and specification of their implementation structure gains importance in order to maintain the evolvabil...
Kim Mens, Andy Kellens
ICCS
2003
Springer
16 years 23 hour ago
Measurement Models for Survivability and Competitiveness of Very Large E-marketplace
E-Marketplace is a man-made profit center with emergent customer requirements. This emergence nature poses many difficulties for e-marketplace to satisfy its customers and thus aff...
Jingzhi Guo, Chengzheng Sun
ASYNC
2002
IEEE
114views Hardware» more  ASYNC 2002»
15 years 11 months ago
Checking Delay-Insensitivity: 104 Gates and Beyond
Wire and gate delays are accounted to have equal, or nearly equal, effect on circuit behavior in modern design techniques. This paper introduces a new approach to verify circuits ...
Alex Kondratyev, Oriol Roig, Lawrence Neukom, Karl...
STOC
1994
ACM
123views Algorithms» more  STOC 1994»
15 years 11 months ago
Natural proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
Alexander A. Razborov, Steven Rudich