Sciweavers

332 search results - page 20 / 67
» An Aristotelian notion of size
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 2 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
DIS
2010
Springer
14 years 8 months ago
Adapted Transfer of Distance Measures for Quantitative Structure-Activity Relationships
Quantitative structure-activity relationships (QSARs) are regression models relating chemical structure to biological activity. Such models allow to make predictions for toxicologi...
Ulrich Rückert, Tobias Girschick, Fabian Buch...
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
14 years 7 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
68
Voted
JMLR
2010
88views more  JMLR 2010»
14 years 4 months ago
Unsupervised Aggregation for Classification Problems with Large Numbers of Categories
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
Ivan Titov, Alexandre Klementiev, Kevin Small, Dan...
79
Voted
OOPSLA
2009
Springer
15 years 4 months ago
A market-based approach to software evolution
Software correctness has bedeviled the field of computer science since its inception. Software complexity has increased far more quickly than our ability to control it, reaching ...
David F. Bacon, Yiling Chen, David C. Parkes, Malv...