Sciweavers

2435 search results - page 198 / 487
» Intellexer Question Answering
Sort
View
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 10 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 10 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
FSTTCS
2009
Springer
15 years 10 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
GCB
2009
Springer
141views Biometrics» more  GCB 2009»
15 years 10 months ago
Discovering Temporal Patterns of Differential Gene Expression in Microarray Time Series
: A wealth of time series of microarray measurements have become available over recent years. Several two-sample tests for detecting differential gene expression in these time seri...
Oliver Stegle, Katherine J. Denby, David L. Wild, ...
128
Voted
KCAP
2009
ACM
15 years 10 months ago
Multimodal knowledge capture from text and diagrams
Many information sources use multiple modalities, such as textbooks, which contain both text and diagrams. Each captures information that is hard to express in the other, and evid...
Kate Lockwood, Kenneth D. Forbus