Sciweavers

1168 search results - page 130 / 234
» cases 2000
Sort
View
COMPULOG
1999
Springer
15 years 2 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
ICDT
1997
ACM
108views Database» more  ICDT 1997»
15 years 2 months ago
Incorporating User Preferences in Multimedia Queries
A “scoring rule” is an assignment of a value to every tuple (of varying sizes). This paper is concerned with the issue of how to modify a scoring rule to apply to the case whe...
Ronald Fagin, Edward L. Wimmers
CASES
2007
ACM
15 years 1 months ago
A backtracking instruction scheduler using predicate-based code hoisting to fill delay slots
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...
Tom Vander Aa, Bingfeng Mei, Bjorn De Sutter
EDBT
2000
ACM
15 years 1 months ago
Materialized View Selection for Multi-Cube Data Models
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
ER
2000
Springer
139views Database» more  ER 2000»
15 years 1 months ago
Semantic Analysis Patterns
The development of object-oriented software starts from requirements expressed commonly as Use Cases. The requirements are then converted into a conceptual or analysis model. Analy...
Eduardo B. Fernández, Xiaohong Yuan