Sciweavers

4781 search results - page 806 / 957
» Complexity at large
Sort
View
INFOCOM
2011
IEEE
13 years 2 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
ISBI
2011
IEEE
13 years 2 months ago
Group sparsity based classification for cervigram segmentation
This paper presents an algorithm to classify pixels in uterine cervix images into two classes, namely normal and abnormal tissues, and simultaneously select relevant features, usi...
Yang Yu, Junzhou Huang, Shaoting Zhang, Christophe...
BMCBI
2011
13 years 1 months ago
Robust joint analysis allowing for model uncertainty in two-stage genetic association studies
Background: The cost efficient two-stage design is often used in genome-wide association studies (GWASs) in searching for genetic loci underlying the susceptibility for complex di...
Dongdong Pan, Qizhai Li, Ningning Jiang, Aiyi Liu,...
SIGIR
2011
ACM
13 years 1 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
13 years 1 months ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno