381 search results - page 49 / 77 » Re-imagining the first year of computing |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
175
click to vote
FCCM
2011
IEEE
14 years 1 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
PODC
2011
ACM
14 years 24 days ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
JASIS
2007
14 years 10 months ago
2007
We present evidence that, in some research fields, research published in journals and reported on the Web may collectively represent different evolutionary stages of the field wit...
SEMWEB
2007
Springer
15 years 4 months ago
2007
Springer
Numerous ontology alignment algorithms have appeared in the literature in recent years, but only a few make use of the semantics enclosed within the ontologies in order to improve ...