Sciweavers

2542 search results - page 357 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 10 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
EWSN
2008
Springer
14 years 10 months ago
A Component Framework for Content-Based Publish/Subscribe in Sensor Networks
Component-based architectures are the traditional approach cile application specific optimization with reusable abstractions in sensor networks. However, they frequently overwhelm ...
Adam Wolisz, Andreas Köpke, Andreas Willig, J...
ICASSP
2009
IEEE
14 years 5 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
ADBIS
2009
Springer
143views Database» more  ADBIS 2009»
14 years 5 months ago
Cost-Based Vectorization of Instance-Based Integration Processes
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
Matthias Böhm, Dirk Habich, Steffen Preissler...
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
14 years 5 months ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...