Sciweavers

505 search results - page 13 / 101
» Universal Constructions for Large Objects
Sort
View
92
Voted
EJC
2006
14 years 11 months ago
Perfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
Vojtech Rödl, Andrzej Rucinski, Endre Szemer&...
KES
2006
Springer
14 years 11 months ago
Integrated Document Browsing and Data Acquisition for Building Large Ontologies
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
Felix Weigel, Klaus U. Schulz, Levin Brunner, Edua...
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 11 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
JOOP
1998
98views more  JOOP 1998»
14 years 11 months ago
Design Patterns as Language Constructs
Design patterns have proven to be very useful for the design of object-oriented systems. The power of design patterns stems from their ability to provide generic solutions to reap...
Jan Bosch
AAAI
2006
15 years 1 months ago
Large Scale Knowledge Base Systems: An Empirical Evaluation Perspective
In this paper, we discuss how our work on evaluating Semantic Web knowledge base systems (KBSs) contributes to address some broader AI problems. First, we show how our approach pr...
Yuanbo Guo, Abir Qasem, Jeff Heflin