Sciweavers

2446 search results - page 473 / 490
» Choiceless Polynomial Time
Sort
View
ECOWS
2008
Springer
13 years 9 months ago
Beyond Soundness: On the Semantic Consistency of Executable Process Models
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
Ingo Weber, Jörg Hoffmann, Jan Mendling
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 9 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
NIPS
2008
13 years 9 months ago
Recursive Segmentation and Recognition Templates for 2D Parsing
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...
Leo Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan ...
NIPS
2007
13 years 9 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
SPLC
2008
13 years 9 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt