Sciweavers

5084 search results - page 268 / 1017
» Proving Possibility Properties
Sort
View
ACL
2008
15 years 8 months ago
Decompounding query keywords from compounding languages
Splitting compound words has proved to be useful in areas such as Machine Translation, Speech Recognition or Information Retrieval (IR). Furthermore, real-time IR systems (such as...
Enrique Alfonseca, Slaven Bilac, Stefan Pharies
CCCG
2003
15 years 8 months ago
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
David Hart
WSCG
2001
76views more  WSCG 2001»
15 years 8 months ago
On Synchronized Simulation in a Distributed Virtual Environment
This paper addresses communication problems in a distributed virtual reality system. The paper presents VOODIE, a system that provides a framework for distributed virtual environm...
Marko Meister, Charles A. Wüthrich
MVA
1994
100views Computer Vision» more  MVA 1994»
15 years 8 months ago
Image Analysis for Automated Pavement Cracking Evaluation
Image processing technology plays an important part in the analysis and evaluation of pavement surface cracking. The pattern recognition method for crack geometry proposed in this...
Hideki Shimamura, Kazuhiro Oonuma, Yoshizumi Yasud...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
15 years 6 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch