Sciweavers

7342 search results - page 1463 / 1469
» Optimal Language Learning
Sort
View
DLOG
2001
13 years 8 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
WIESS
2000
13 years 8 months ago
Stub-Code Performance Is Becoming Important
As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
Andreas Haeberlen, Jochen Liedtke, Yoonho Park, La...
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 8 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
MOBISYS
2010
ACM
13 years 9 months ago
MAUI: making smartphones last longer with code offload
This paper presents MAUI, a system that enables fine-grained energy-aware offload of mobile code to the infrastructure. Previous approaches to these problems either relied heavily...
Eduardo Cuervo, Aruna Balasubramanian, Dae-ki Cho,...
AI
2008
Springer
13 years 7 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz
« Prev « First page 1463 / 1469 Last » Next »