Sciweavers

13841 search results - page 2691 / 2769
» Algorithms and Constraint Programming
Sort
View
ICS
2009
Tsinghua U.
15 years 9 months ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell
INFOCOM
2009
IEEE
15 years 9 months ago
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
Zhichao Zhu, Guohong Cao, Sencun Zhu, Supranamaya ...
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 9 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
WABI
2009
Springer
142views Bioinformatics» more  WABI 2009»
15 years 9 months ago
Back-Translation for Discovering Distant Protein Homologies
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
Marta Gîrdea, Laurent Noé, Gregory Ku...
ATAL
2009
Springer
15 years 9 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
« Prev « First page 2691 / 2769 Last » Next »