Sciweavers

710 search results - page 135 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
EDBT
2008
ACM
111views Database» more  EDBT 2008»
14 years 7 months ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich
CDC
2010
IEEE
13 years 2 months ago
Preference elicitation in Fully Probabilistic Design of decision strategies
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
Miroslav Kárný, Tatiana V. Guy
SIGIR
2006
ACM
14 years 1 months ago
Semantic term matching in axiomatic approaches to information retrieval
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
Hui Fang, ChengXiang Zhai
SIGMOD
2005
ACM
141views Database» more  SIGMOD 2005»
14 years 7 months ago
Integrating databases and workflow systems
There has been an information explosion in fields of science such as high energy physics, astronomy, environmental sciences and biology. There is a critical need for automated sys...
Srinath Shankar, Ameet Kini, David J. DeWitt, Jeff...
TCS
2008
13 years 7 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...