Sciweavers

1523 search results - page 269 / 305
» Partially ordered secretaries
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
15 years 10 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
70
Voted
CHI
2008
ACM
15 years 10 months ago
LivOlay: interactive ad-hoc registration and overlapping of applications for collaborative visual exploration
The interoperability of disparate data types and sources has been a long standing problem and a hindering factor for the efficacy and efficiency in visual exploration applications...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Michel...
77
Voted
CHI
2007
ACM
15 years 10 months ago
An eye tracking study of the effect of target rank on web search
Web search engines present search results in a rank ordered list. This works when what a user wants is near the top, but sometimes the information that the user really wants is lo...
Zhiwei Guan, Edward Cutrell
179
Voted
POPL
2007
ACM
15 years 10 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano
POPL
2006
ACM
15 years 10 months ago
Harmless advice
This paper defines an object-oriented language with harmless aspect-oriented advice. A piece of harmless advice is a computation that, like ordinary aspect-oriented advice, execut...
Daniel S. Dantas, David Walker