Sciweavers

2029 search results - page 405 / 406
» informs 2002
Sort
View
89
Voted
PAA
2007
14 years 10 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...
89
Voted
JMLR
2010
103views more  JMLR 2010»
14 years 5 months ago
Regret Bounds and Minimax Policies under Partial Monitoring
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
Jean-Yves Audibert, Sébastien Bubeck
118
Voted
CHI
2002
ACM
15 years 11 months ago
CHI@20: fighting our way from marginality to power
The Special Interest Group on Computer Human Interaction (SIGCHI) has had a successful history of 20 years of growth in its numbers and influence. To help guide the continued evol...
Ben Shneiderman, Stuart K. Card, Donald A. Norman,...
84
Voted
GI
2004
Springer
15 years 4 months ago
Extreme Programming in der Informatik-Lehre - Ein Erfahrungsbericht
: eXtreme Programming (XP) ist eine Symbiose verschiedener Techniken, die erst durch ihr Zusammenwirken ihre besondere Qualit¨at agiler Softwareentwicklung aufweisen. Sie lassen s...
Holger Mügge, Daniel Speicher, Günter Kn...
86
Voted
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 4 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen