Sciweavers

446 search results - page 62 / 90
» A new paradigm for programming competitions
Sort
View
CC
2004
Springer
160views System Software» more  CC 2004»
14 years 2 months ago
Elkhound: A Fast, Practical GLR Parser Generator
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
Scott McPeak, George C. Necula
IJFCS
2006
111views more  IJFCS 2006»
13 years 8 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
FUIN
2010
109views more  FUIN 2010»
13 years 7 months ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva
JMLR
2010
149views more  JMLR 2010»
13 years 3 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
AAAI
2012
11 years 11 months ago
Learning the Kernel Matrix with Low-Rank Multiplicative Shaping
Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) ...
Tomer Levinboim, Fei Sha