Sciweavers

197 search results - page 14 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
PVLDB
2008
108views more  PVLDB 2008»
13 years 6 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
JMLR
2010
124views more  JMLR 2010»
13 years 2 months ago
Multiclass-Multilabel Classification with More Classes than Examples
We discuss multiclass-multilabel classification problems in which the set of classes is extremely large. Most existing multiclass-multilabel learning algorithms expect to observe ...
Ofer Dekel, Ohad Shamir
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 22 days ago
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
Thang Nguyen Bui, Waleed A. Youssef
CP
2008
Springer
13 years 9 months ago
Reformulating Positive Table Constraints Using Functional Dependencies
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
Hadrien Cambazard, Barry O'Sullivan
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura