Sciweavers

175 search results - page 9 / 35
» Partially Ordered Runs: A Case Study
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 7 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
14 years 7 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
ALMOB
2008
160views more  ALMOB 2008»
13 years 7 months ago
Syntenator: Multiple gene order alignments with a gene-specific scoring function
Background: Identification of homologous regions or conserved syntenies across genomes is one crucial step in comparative genomics. This task is usually performed by genome alignm...
Christian Rödelsperger, Christoph Dieterich
AIPS
2000
13 years 8 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
IJCM
2002
97views more  IJCM 2002»
13 years 7 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...