Sciweavers

1332 search results - page 255 / 267
» Combinatorial Algorithms
Sort
View
WWW
2011
ACM
13 years 2 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
ICALP
2009
Springer
14 years 8 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
AGP
2003
IEEE
14 years 1 months ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
RECOMB
2009
Springer
14 years 8 months ago
Spatial Clustering of Multivariate Genomic and Epigenomic Information
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...
Rami Jaschek, Amos Tanay