Sciweavers

263 search results - page 24 / 53
» On the Containment of Forbidden Patterns Problems
Sort
View
COLING
1996
15 years 1 months ago
Analysis of Japanese Compound Nouns by Direct Text Scanning
This paper aims to analyze word dependency structure in compound nouns appearing in Japanese newspaper articles. The analysis is a dil't:icult problem because such compound n...
Toru Hisamitsu, Yoshihiko Nitta
SLSFS
2005
Springer
15 years 5 months ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
Amit Gruber, Yair Weiss
MST
2006
104views more  MST 2006»
14 years 11 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
STACS
2010
Springer
15 years 6 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
CBMS
2006
IEEE
15 years 5 months ago
An Ontology-Driven Mediator for Querying Time-Oriented Biomedical Data
— Most biomedical research databases contain considerable amounts of time-oriented data. However, temporal knowledge about the contextual meaning of such data is not usually repr...
Martin J. O'Connor, Ravi Shankar, Amar K. Das