Sciweavers

26472 search results - page 4963 / 5295
» Interactive
Sort
View
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
16 years 9 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
DBPL
2005
Springer
143views Database» more  DBPL 2005»
16 years 9 days ago
Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
Diego Calvanese, Giuseppe De Giacomo, Domenico Lem...
DCOSS
2005
Springer
16 years 9 days ago
jWebDust : A Java-Based Generic Application Environment for Wireless Sensor Networks
Abstract. Wireless sensor networks can be very useful in applications that require the detection of crucial events, in physical environments subjected to critical conditions, and t...
Ioannis Chatzigiannakis, Georgios Mylonas, Sotiris...
DEXA
2005
Springer
148views Database» more  DEXA 2005»
16 years 9 days ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
185
Voted
DIGRA
2005
Springer
16 years 9 days ago
Beyond P-1: Who Plays Online?
Academics and industry professionals alike have long been interested in developing a nuanced and empirically sound typography of online gamers. Designers and engineers are aware o...
Avery Alix
« Prev « First page 4963 / 5295 Last » Next »