116 search results - page 19 / 24 » Implicit B-Trees: New Results for the Dictionary Problem |
SOFTVIS
2005
ACM
15 years 3 months ago
2005
ACM
Large software projects often require a programmer to make changes to unfamiliar source code. This paper presents the results of a formative observational study of seven professio...
MOBIHOC
2000
ACM
15 years 2 months ago
2000
ACM
— We present an approach to multicasting messages among highly mobile hosts in ad hoc networks. We suggest a new definition of a role-based multicast that suits the special need...
COCO
1998
Springer
15 years 2 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
ACL
2003
14 years 11 months ago
2003
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
DAGSTUHL
2003
14 years 11 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...