Sciweavers

284 search results - page 48 / 57
» Linear Time Algorithms for Generalized Edge Dominating Set P...
Sort
View
AAAI
2004
13 years 9 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
RECOMB
2006
Springer
14 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...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
AAAI
1998
13 years 9 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
14 years 9 months ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant