Sciweavers

6368 search results - page 1132 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
15 years 10 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 12 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
164
Voted
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 10 months ago
Initialization parameter sweep in ATHENA: optimizing neural networks for detecting gene-gene interactions in the presence of sma
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
Emily Rose Holzinger, Carrie C. Buchanan, Scott M....
CCR
1999
92views more  CCR 1999»
15 years 4 months ago
YESSIR: a simple reservation mechanism for the Internet
Abstract-RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message...
Ping Pan, Henning Schulzrinne
EDBT
2000
ACM
15 years 9 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
« Prev « First page 1132 / 1274 Last » Next »