Sciweavers

1532 search results - page 263 / 307
» Connection Relations in Mereotopology
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
14 years 1 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
EELC
2006
125views Languages» more  EELC 2006»
14 years 1 months ago
How Do Children Develop Syntactic Representations from What They Hear?
nstructional schemas, both specific and abstract. Children are thought to start out with concrete pieces of language and to gradually develop more schematic constructions. All cons...
Elena Lieven
ERCIMDL
2006
Springer
234views Education» more  ERCIMDL 2006»
14 years 1 months ago
Intelligent Bibliography Creation and Markup for Authors: A Step Towards Interoperable Digital Libraries
The move towards integrated international Digital Libraries offers the opportunity of creating comprehensive data on citation networks. These data are not only invaluable pointers ...
Bettina Berendt, Kai Dingel, Christoph Hanser
EUROSSC
2006
Springer
14 years 1 months ago
Towards Hovering Information
This paper introduces a new concept of information that can exist in a mobile environment with no fixed infrastructure and centralized servers, which we call the Hovering Informati...
Alfredo A. Villalba Castro, Dimitri Konstantas