Sciweavers

9842 search results - page 1605 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 7 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 7 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
KDD
2002
ACM
160views Data Mining» more  KDD 2002»
16 years 7 months ago
Scaling multi-class support vector machines using inter-class confusion
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
Shantanu Godbole, Sunita Sarawagi, Soumen Chakraba...
HPCA
2006
IEEE
16 years 7 months ago
CORD: cost-effective (and nearly overhead-free) order-recording and data race detection
Chip-multiprocessors are becoming the dominant vehicle for general-purpose processing, and parallel software will be needed to effectively utilize them. This parallel software is ...
Milos Prvulovic
RECOMB
2006
Springer
16 years 7 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
« Prev « First page 1605 / 1969 Last » Next »