2899 search results - page 551 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
108
click to vote
ACL
2003
15 years 2 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
118
click to vote
BMCBI
2010
2010
The IronChip evaluation package: a package of perl modules for robust analysis of custom microarrays
15 years 1 months ago
Background: Gene expression studies greatly contribute to our understanding of complex relationships in gene regulatory networks. However, the complexity of array design, producti...
111
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
137
click to vote
COCO
1994
Springer
15 years 5 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
133
click to vote
SIGGRAPH
1997
ACM
15 years 4 months ago
1997
ACM
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...