Sciweavers

137 search results - page 10 / 28
» Cross-Serial Dependencies Are Not Hard to Process
Sort
View
CIKM
2010
Springer
14 years 7 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
SIGSOFT
2003
ACM
15 years 10 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
WSDM
2010
ACM
173views Data Mining» more  WSDM 2010»
15 years 6 months ago
Measuring the Reusability of Test Collections
While test collection construction is a time-consuming and expensive process, the true cost is amortized by reusing the collection over hundreds or thousands of experiments. Some ...
Ben Carterette, Evgeniy Gabrilovich, Vanja Josifov...
VTC
2008
IEEE
120views Communications» more  VTC 2008»
15 years 3 months ago
Low Backhaul Distributed Detection Strategies for an Interference Limited Uplink Cellular System
— This paper deals with multiuser detection through base station cooperation in uplink interference limited scenarios. At high frequency reuse, each base station not only receive...
Shahid Khattak, Gerhard Fettweis
EUROPAR
2007
Springer
15 years 3 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou