Result 1 to 20 of 146 total
A bicriteria approximation for the reordering buffer problem. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 157-168 (2012).
1
Advances in knowledge discovery and data mining. 16th Pacific-Asia conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29‒June 1, 2012. Proceedings, Part II. (English)
Lecture Notes in Computer Science 7302. Lecture Notes in Artificial Intelligence. Berlin: Springer (ISBN 978-3-642-30219-0/pbk). xxiv, 445~p. \$~95.00 (2012).
2
Advances in knowledge discovery and data mining. 16th Pacific-Asia conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29‒June 1, 2012. Proceedings, Part I. (English)
Lecture Notes in Computer Science 7301. Lecture Notes in Artificial Intelligence. Berlin: Springer (ISBN 978-3-642-30216-9/pbk). xxiii, 619~p. \$~119.00 (2012).
3
On mining anomalous patterns in road traffic streams. (English)
Tang, Jie (ed.) et al., Advanced data mining and applications. 7th international conference, ADMA 2011, Beijing, China, December 17‒19, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-25855-8/pbk). Lecture Notes in Computer Science 7121. Lecture Notes in Artificial Intelligence, 237-251 (2011).
4
Part special issue: 40th annual ACM symposium on theory of computing (STOC 2008). Selected papers based on the presentations at the symposium, Victoria, British Columbia, Canada, May 17‒20, 2008. (English)
SIAM J. Comput. 40, No. 6, 1738-2000 (2011).
5
Forms of interaction in virtual space: applications to psychotherapy and counselling. (English)
Stephanidis, Constantine (ed.), Universal access in human-computer interaction. Applications and services. 6th international conference, UAHCI 2011, held as Part of HCI international 2011, Orlando, FL, USA, July 9‒14, 2011. Proceedings, Part IV. Berlin: Springer (ISBN 978-3-642-21656-5/pbk). Lecture Notes in Computer Science 6768, 313-321 (2011).
6
Class confidence weighted $k$NN algorithms for imbalanced data sets. (English)
Huang, Joshua Zhexue (ed.) et al., Advances in knowledge discovery and data mining. 15th Pacific-Asia conference, PAKDD 2011, Shenzhen, China, May 24‒27, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-20846-1/pbk). Lecture Notes in Computer Science 6635. Lecture Notes in Artificial Intelligence, 345-356 (2011).
7
High scent web page recommendations using fuzzy rough set attribute reduction. (English)
Peters, James F. (ed.) et al., Transactions on Rough Sets XIV. Berlin: Springer (ISBN 978-3-642-21562-9/pbk). Lecture Notes in Computer Science 6600. Journal Subline, 18-36 (2011).
8
Bayesian mechanism design for budget-constrained agents. (English)
Comput. Res. Repos. 2011, Article No. 1103.6280 (2011).
9
Robust record linkage blocking using suffix arrays and bloom filters (English)
TKDD 5, No. 2, 9 (2011).
10
High scent web page recommendations using fuzzy rough set attribute reduction (English)
T. Rough Sets 14, 18-36 (2011).
11
A survey of virtualization on mobiles (English)
ACC (2), 430-441 (2011).
12
Class confidence weighted $k$NN algorithms for imbalanced data sets (English)
PAKDD (2), 345-356 (2011).
13
A quadratic mean based supervised learning model for managing data skewness (English)
SDM, 188-198 (2011).
14
Forms of interaction in virtual space: applications to psychotherapy and counselling (English)
HCI (8), 313-321 (2011).
15
GOREWEB framework for goal oriented requirements engineering of web applications (English)
IC3, 229-241 (2011).
16
Bayesian mechanism design for budget-constrained agents (English)
ACM Conference on Electronic Commerce, 253-262 (2011).
17
On mining anomalous patterns in road traffic streams (English)
ADMA (2), 237-251 (2011).
18
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness (English)
SIGMETRICS, 145-146 (2011).
19
A robust index for regular expression queries (English)
CIKM, 2365-2368 (2011).
20
Result 1 to 20 of 146 total
Start
Contact
Print
General Help
