Sciweavers

266 search results - page 49 / 54
» A greedy genetic algorithm for the quadratic assignment prob...
Sort
View
CASES
2004
ACM
14 years 27 days ago
Procedure placement using temporal-ordering information: dealing with code size expansion
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
Christophe Guillon, Fabrice Rastello, Thierry Bida...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 10 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
TSMC
2008
102views more  TSMC 2008»
13 years 7 months ago
Context-Dependent DNA Coding With Redundancy and Introns
Abstract--Deoxyribonucleic acid (DNA) coding methods determine the meaning of a certain character in individual chromosomes by the characters surrounding it. The meaning of each ch...
Peng Xiao, Prahlad Vadakkepat, Tong Heng Lee
NIPS
2008
13 years 9 months ago
Predicting the Geometry of Metal Binding Sites from Protein Sequence
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
Paolo Frasconi, Andrea Passerini
NIPS
2003
13 years 8 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller