Sciweavers

2479 search results - page 392 / 496
» A Computational Theory of Working Memory
Sort
View
188
Voted
VLDB
2011
ACM
245views Database» more  VLDB 2011»
15 years 1 months ago
Normalization and optimization of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. They are an important tool in several areas of database research, notab...
Georg Gottlob, Reinhard Pichler, Vadim Savenkov
TCAD
2010
168views more  TCAD 2010»
15 years 25 days ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
CORR
2011
Springer
151views Education» more  CORR 2011»
15 years 18 days ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 6 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
CCGRID
2005
IEEE
15 years 11 months ago
Evaluating high-throughput reliable multicast for grid applications in production networks
Grid computing can be characterized as a distributed infrastructure that is a collection of computing resources within or across locations that are aggregated to act as a unified ...
Marinho P. Barcellos, Maziar Nekovee, M. Koyabe, M...