35419 search results - page 151 / 7084 » How are we doing |
124
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
110
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
129
click to vote
ACE
2004
15 years 5 months ago
2004
This paper discusses our rationale for teaching the fundamentals of computer architecture early in the computer science (CS) degree program. We also describe an active learning te...
149
click to vote
ACL
2012
13 years 6 months ago
2012
In this paper we introduce the novel task of “word epoch disambiguation,” defined as the problem of identifying changes in word usage over time. Through experiments run using...
112
click to vote
ISSAC
2005
Springer
15 years 9 months ago
2005
Springer
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...