Sciweavers

1688 search results - page 191 / 338
» The Complexity of Rationalizing Matchings
Sort
View
SEBD
2007
113views Database» more  SEBD 2007»
15 years 27 days ago
Conditional Preferences: A New Semantics for Database Queries
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preference...
Paolo Ciaccia
GRAPHICSINTERFACE
2003
15 years 26 days ago
Dynamic Canvas for Non-Photorealistic Walkthroughs
The static background paper or canvas texture usually used for non-photorealistic animation greatly impedes the sensation of motion and results in a disturbing “shower door” e...
Matthieu Cunzi, Joëlle Thollot, Sylvain Paris...
SCS
2004
15 years 26 days ago
Contract-Based Justification for COTS Component within Safety Critical Applications
Commercial-Off-The-Shelf (COTS) software components are being used within complex safety-critical applications. However, to use them with confidence, it is necessary to ensure tha...
Fan Ye, Tim Kelly
TREC
2003
15 years 26 days ago
UIC at TREC-2003: Robust Track
In TREC 2003, the Database and Information System Lab (DBIS) at University of Illinois at Chicago (UIC) participate in the robust track, which is a traditional ad hoc retrieval ta...
Shuang Liu, Clement T. Yu
CIIA
2009
15 years 18 days ago
Physical Synthesis for CPLD Architectures
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
Sid-Ahmed Senouci