Sciweavers

1232 search results - page 156 / 247
» Digraphs: theory, algorithms and applications
Sort
View
SIGIR
2004
ACM
14 years 2 months ago
Probabilistic model for contextual retrieval
Contextual retrieval is a critical technique for facilitating many important applications such as mobile search, personalized search, PC troubleshooting, etc. Despite of its impor...
Ji-Rong Wen, Ni Lao, Wei-Ying Ma
RTSS
2002
IEEE
14 years 2 months ago
Maximizing the System Value while Satisfying Time and Energy Constraints
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
Cosmin Rusu, Rami G. Melhem, Daniel Mossé
TACS
2001
Springer
14 years 1 months ago
A Logic Programming Language Based on Binding Algebras
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
Makoto Hamana
ALT
2003
Springer
14 years 24 days ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
SIGMOD
2010
ACM
249views Database» more  SIGMOD 2010»
13 years 9 months ago
Worry-free database upgrades: automated model-driven evolution of schemas and complex mappings
Schema evolution is an unavoidable consequence of the application development lifecycle. The two primary schemas in an application, the client conceptual object model and the pers...
James F. Terwilliger, Philip A. Bernstein, Adi Unn...