Sciweavers

417 search results - page 39 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
ATAL
2007
Springer
14 years 3 months ago
Average-case tractability of manipulation in voting via the fraction of manipulators
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2008
Springer
13 years 11 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
ACMSE
2010
ACM
13 years 7 months ago
Automatic generation of model traversals from metamodel definitions
Developing software from models is a growing practice and there exist many model-based tools (e.g., model editors, model interpreters) for supporting model-driven engineering. Eve...
Tomaz Lukman, Marjan Mernik, Zekai Demirezen, Barr...
APVIS
2011
12 years 9 months ago
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
Steffen Frey, Thomas Schlömer, Sebastian Grot...
SIGIR
2008
ACM
13 years 9 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...