Sciweavers

64 search results - page 7 / 13
» Reducing computational complexity with array predicates
Sort
View
CLUSTER
2004
IEEE
13 years 11 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
VTS
1995
IEEE
94views Hardware» more  VTS 1995»
13 years 11 months ago
Synthesis of locally exhaustive test pattern generators
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
Günter Kemnitz
IEAAIE
1999
Springer
14 years 6 days ago
Modelling Fuzzy Sets Using Object-Oriented Techniques
This paper describes a new approach to model fuzzy sets using object-oriented programming techniques. Currently, the most frequently used method to model fuzzy sets is by using a p...
Gary Yat Chung Wong, Hon Wai Chun
ESA
2004
Springer
139views Algorithms» more  ESA 2004»
14 years 1 months ago
Comparing Real Algebraic Numbers of Small Degree
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
Ioannis Z. Emiris, Elias P. Tsigaridas
EDBT
2010
ACM
200views Database» more  EDBT 2010»
14 years 2 months ago
Rewrite techniques for performance optimization of schema matching processes
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Eric Peukert, Henrike Berthold, Erhard Rahm