Sciweavers

1952 search results - page 358 / 391
» Complete partitions of graphs
Sort
View
BIRD
2008
Springer
158views Bioinformatics» more  BIRD 2008»
15 years 6 months ago
A Computational Method for Reconstructing Gapless Metabolic Networks
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...
Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko ...
COLT
2008
Springer
15 years 6 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
LREC
2010
163views Education» more  LREC 2010»
15 years 5 months ago
Meaning Representation: From Continuity to Discreteness
This paper presents a geometric approach to meaning representation within the framework of continuous mathematics. Meaning representation is a central issue in Natural Language Pr...
Fabienne Venant
LREC
2008
151views Education» more  LREC 2008»
15 years 5 months ago
A LAF/GrAF based Encoding Scheme for underspecified Representations of syntactic Annotations
Data models and encoding formats for syntactically annotated text corpora need to deal with syntactic ambiguity; underspecified representations are particularly well suited for th...
Manuel Kountz, Ulrich Heid, Kerstin Eckart
133
Voted
AAAI
2004
15 years 5 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao