Sciweavers

3395 search results - page 592 / 679
» Designs, Disputes and Strategies
Sort
View
SPAA
2009
ACM
14 years 9 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 9 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
CHI
2008
ACM
14 years 9 months ago
Optimal parameters for efficient crossing-based dialog boxes
We present an empirical analysis of crossing-based dialog boxes. First, we study the spatial constraints required for efficient crossing-based interactions in the case of a simple...
Morgan Dixon, François Guimbretière,...
CHI
2007
ACM
14 years 9 months ago
ExperiScope: an analysis tool for interaction data
We present ExperiScope, an analytical tool to help designers and experimenters explore the results of quantitative evaluations of interaction techniques. ExperiScope combines a ne...
François Guimbretière, Ken Hinckley,...