Sciweavers

4047 search results - page 558 / 810
» The Discrete Basis Problem
Sort
View
P2P
2003
IEEE
115views Communications» more  P2P 2003»
15 years 10 months ago
NanoPeer Networks and P2P Worlds
We present the NanoPeers architecture paradigm, a peer-to-peer network of lightweight devices, lacking all or most of the capabilities of their computer-world counterparts. We ide...
Peter Triantafillou, Nikos Ntarmos, Sotiris E. Nik...
VL
2003
IEEE
134views Visual Languages» more  VL 2003»
15 years 10 months ago
End-user programming as translation: an experimental framework and study
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
Christopher D. Hundhausen, Ravikiran Vatrapu, Josh...
CP
2003
Springer
15 years 10 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
ACIIDS
2009
IEEE
144views Database» more  ACIIDS 2009»
15 years 9 months ago
Processing Exact Results for Sliding Window Joins over Time-Sequence, Streaming Data Using a Disk Archive
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...
Abhirup Chakraborty, Ajit Singh
HPDC
2002
IEEE
15 years 9 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster