Sciweavers

5964 search results - page 429 / 1193
» A theory of speculative computation
Sort
View
209
Voted
COLING
2002
15 years 7 months ago
Effective Structural Inference for Large XML Documents
This paper investigates methods to automatically infer structural information from large XML documents. Using XML as a reference format, we approach the schema generation problem ...
Jason Sankey, Raymond K. Wong
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 7 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
CORR
2002
Springer
87views Education» more  CORR 2002»
15 years 7 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
ISF
2000
103views more  ISF 2000»
15 years 7 months ago
Oracles, Bards, and Village Gossips, or Social Roles and Meta Knowledge Management
Knowledge management systems are used widely in many different organizations, yet there are few models and theories which can be used to help introduce and apply them successfully....
Simon Masterton, Stuart Watt
JACM
2002
122views more  JACM 2002»
15 years 7 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer