Sciweavers

31 search results - page 4 / 7
» Counting Unique-Sink Orientations
Sort
View
ACL
2001
13 years 7 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
JCT
2011
141views more  JCT 2011»
13 years 1 months ago
Bijections for Baxter families and related objects
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
Stefan Felsner, Éric Fusy, Marc Noy, David ...
PR
2008
100views more  PR 2008»
13 years 6 months ago
Boundary based shape orientation
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
Jovisa D. Zunic, Milos Stojmenovic
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 6 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
WETICE
1999
IEEE
13 years 10 months ago
Collective Choice in Virtual Teams
Virtual organisations within and across enterprise structures are becoming mature as a potentially effective means for goal oriented business teamwork. Among the plentyful of supp...
Alois Ferscha, Christoph Scheiner