Sciweavers

3384 search results - page 515 / 677
» More Testable Properties
Sort
View
MSCS
2007
92views more  MSCS 2007»
13 years 9 months ago
Restriction categories III: colimits, partial limits and extensivity
ction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of...
J. Robin B. Cockett, Stephen Lack
MST
2007
154views more  MST 2007»
13 years 9 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
PAMI
2007
176views more  PAMI 2007»
13 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
SPEECH
2008
81views more  SPEECH 2008»
13 years 9 months ago
Supervised and unsupervised learning of multidimensionally varying non-native speech categories
The acquisition of novel phonetic categories is hypothesized to be affected by the distributional properties of the input, the relation of the new categories to the native phonolo...
Martijn Goudbeek, Anne Cutler, Roel Smits
ACTA
2008
88views more  ACTA 2008»
13 years 9 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish