Sciweavers

562 search results - page 56 / 113
» Dependency Pairs Revisited
Sort
View
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 2 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
111
Voted
CVPR
2010
IEEE
15 years 10 months ago
A Game-Theoretic Approach to Fine Surface Registration without Initial Motion Estimation
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. This is typically a two step process where an initial coarse motion estimation is fo...
Andrea Albarelli, Andrea Torsello, Emanuele Rodol
116
Voted
ASIACRYPT
2009
Springer
15 years 8 months ago
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
Eric Brier, Shahram Khazaei, Willi Meier, Thomas P...
MICRO
1998
IEEE
128views Hardware» more  MICRO 1998»
15 years 6 months ago
Putting the Fill Unit to Work: Dynamic Optimizations for Trace Cache Microprocessors
The fill unit is the structure which collects blocks of instructions and combines them into multi-block segments for storage in a trace cache. In this paper, we expand the role of...
Daniel H. Friendly, Sanjay J. Patel, Yale N. Patt
133
Voted
ICLP
1997
Springer
15 years 6 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv