17541 search results - page 416 / 3509 » Complexity in scalable computing |
152
click to vote
DLT
2009
15 years 2 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
235
click to vote
ICDE
2004
IEEE
16 years 6 months ago
2004
IEEE
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not nec...
185
click to vote
ICAPR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
162
click to vote
HICSS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper proposes a pioneering Battery-Sensing Intrusion Protection System (B-SIPS) for mobile computers, which alerts on power changes detected on small wireless devices, using...
133
click to vote
GRID
2005
Springer
15 years 10 months ago
2005
Springer
— Developing applications for parallel and distributed systems is hard due to their nondeterministic nature; developing debugging tools for such systems and applications is even ...