Sciweavers

2664 search results - page 494 / 533
» Theory by Process
Sort
View
PODC
2009
ACM
15 years 10 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
15 years 10 months ago
Constrained optimization for validation-guided conditional random field learning
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
Minmin Chen, Yixin Chen, Michael R. Brent, Aaron E...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
15 years 10 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. ...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
15 years 10 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
CHI
2007
ACM
15 years 10 months ago
Work-centered design: a case study of a mixed-initiative scheduler
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
Keith A. Butler, Jiajie Zhang, Chris Esposito, Ali...