Sciweavers

19866 search results - page 362 / 3974
» Computing all factorizations in ***
Sort
View
ACL
2012
13 years 9 months ago
A Computational Approach to the Automation of Creative Naming
In this paper, we propose a computational approach to generate neologisms consisting of homophonic puns and metaphors based on the category of the service to be named and the prop...
Gözde Özbal, Carlo Strapparava
132
Voted
STACS
2007
Springer
16 years 28 days ago
Computing Representations of Matroids of Bounded Branch-Width
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
Daniel Král
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
16 years 10 days ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
HUMAN
2003
Springer
16 years 21 hour ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
MVA
1990
114views Computer Vision» more  MVA 1990»
15 years 8 months ago
Camera Calibration by Computational Projective Geometry
A schcmc of camera calibration is proposed. The focal length and the orientations of the scenc coordinatc axes are computcd by dctecting the vanishing points of two sets of lincs ...
Kenichi Kanatani, Yasuhiro Onodera