Sciweavers

9997 search results - page 1898 / 2000
» The case for crowd computing
Sort
View
OOPSLA
2005
Springer
15 years 3 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
OOPSLA
2005
Springer
15 years 3 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
PKDD
2005
Springer
123views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Multi-metric Index for Euclidean and Periodic Matching
In many classification and data-mining applications the user does not know a priori which distance measure is the most appropriate for the task at hand without examining the produ...
Michail Vlachos, Zografoula Vagena, Vittorio Caste...
RAID
2005
Springer
15 years 3 months ago
Sequence Number-Based MAC Address Spoof Detection
Abstract. The exponential growth in the deployment of IEEE 802.11based wireless LAN (WLAN) in enterprises and homes makes WLAN an attractive target for attackers. Attacks that expl...
Fanglu Guo, Tzi-cker Chiueh
SAT
2005
Springer
129views Hardware» more  SAT 2005»
15 years 3 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
« Prev « First page 1898 / 2000 Last » Next »