Sciweavers

4084 search results - page 644 / 817
» Constraints in spatial structures
Sort
View
EUROPAR
2001
Springer
15 years 8 months ago
Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse
Operand bypass logic might be one of the critical structures for future microprocessors to achieve high clock speed. The delay of the logic imposes the execution time budget to be ...
Toshinori Sato, Itsujiro Arita
VLDB
2001
ACM
108views Database» more  VLDB 2001»
15 years 8 months ago
Potter's Wheel: An Interactive Data Cleaning System
Cleaning data of errors in structure and content is important for data warehousing and integration. Current solutions for data cleaning involve many iterations of data “auditing...
Vijayshankar Raman, Joseph M. Hellerstein
145
Voted
IWPC
2000
IEEE
15 years 8 months ago
The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
Derek Rayside, Steve Reuss, Erik Hedges, Kostas Ko...
140
Voted
VLDB
1999
ACM
174views Database» more  VLDB 1999»
15 years 8 months ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
LICS
1997
IEEE
15 years 8 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof