Sciweavers

1220 search results - page 168 / 244
» Restricting grammatical complexity
Sort
View
SPATIALCOGNITION
2004
Springer
14 years 1 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
STACS
2004
Springer
14 years 1 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
WG
2004
Springer
14 years 1 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
FOCS
2003
IEEE
14 years 1 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
HICSS
2003
IEEE
107views Biometrics» more  HICSS 2003»
14 years 1 months ago
The Customer-Centric Data Warehouse - An Architectural Approach to Meet the Challenges of Customer Orientation
This paper presents research-in-progress. An extensive customer-centric data warehouse architecture should enable both complex analytical queries as well as standard reporting que...
Hans-Georg Kemper, Phil-Lip Lee