Sciweavers

306 search results - page 49 / 62
» From Preference Logics to Preference Languages, and Back
Sort
View
CIDR
2011
337views Algorithms» more  CIDR 2011»
12 years 11 months ago
The Schema-Independent Database UI: A Proposed Holy Grail and Some Suggestions
If you have ever encountered a piece of highly domain-specific business software, you may have noticed that it was largely a graphical front-end to some relational database. You ...
Eirik Bakke, Edward Benson
JMLR
2012
11 years 10 months ago
On Nonparametric Guidance for Learning Autoencoder Representations
Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for...
Jasper Snoek, Ryan Prescott Adams, Hugo Larochelle
MKWI
2008
190views Business» more  MKWI 2008»
13 years 9 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 5 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
WWW
2007
ACM
14 years 8 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...