Sciweavers

2061 search results - page 214 / 413
» The continuous knapsack set
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 5 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICCAD
2007
IEEE
116views Hardware» more  ICCAD 2007»
16 years 1 months ago
Device and architecture concurrent optimization for FPGA transient soft error rate
Late CMOS scaling reduces device reliability, and existing work has studied the permanent SER (soft error rate) for configuration memory in FPGA extensively. In this paper, we sh...
Yan Lin, Lei He
IPPS
2009
IEEE
15 years 11 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
ADBIS
2009
Springer
127views Database» more  ADBIS 2009»
15 years 11 months ago
Window Update Patterns in Stream Operators
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
Kostas Patroumpas, Timos K. Sellis
ALGOSENSORS
2009
Springer
15 years 11 months ago
Compressing Kinetic Data from Sensor Networks
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
Sorelle A. Friedler, David M. Mount