Sciweavers

674 search results - page 97 / 135
» Subwebs for specialized search
Sort
View
SSDBM
2008
IEEE
107views Database» more  SSDBM 2008»
14 years 4 months ago
ProUD: Probabilistic Ranking in Uncertain Databases
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
IPPS
2007
IEEE
14 years 3 months ago
Automatic Trace-Based Performance Analysis of Metacomputing Applications
The processing power and memory capacity of independent and heterogeneous parallel machines can be combined to form a single parallel system that is more powerful than any of its ...
Daniel Becker, Felix Wolf, Wolfgang Frings, Markus...
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 3 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
CLEF
2007
Springer
14 years 3 months ago
The Domain-Specific Track at CLEF 2007
The domain-specific track uses test collections from the social science domain to test monolingual and cross-language retrieval in structured bibliographic databases. Special atte...
Vivien Petras, Stefan Baerisch, Maximilian Stempfh...
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
14 years 3 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna