Sciweavers

2531 search results - page 272 / 507
» Group testing in graphs
Sort
View
JAL
1998
85views more  JAL 1998»
15 years 6 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
JMLR
2010
102views more  JMLR 2010»
15 years 1 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
SIGSOFT
2006
ACM
16 years 7 months ago
Failure proximity: a fault localization-based approach
Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault dia...
Chao Liu 0001, Jiawei Han
GROUP
2009
ACM
16 years 1 months ago
Usability heuristics for networked multiplayer games
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
16 years 3 days ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su