Sciweavers

17920 search results - page 328 / 3584
» Recentering computer science
Sort
View
ACSC
2004
IEEE
15 years 10 months ago
Network Robustness and Graph Topology
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
Anthony H. Dekker, Bernard D. Colbert
FOCS
1991
IEEE
15 years 10 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
FOCS
1992
IEEE
15 years 10 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
FOCS
2008
IEEE
15 years 6 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
GI
2009
Springer
15 years 4 months ago
Tracking of Extended Objects and Group Targets using Random Matrices - A Performance Analysis
: The task of tracking extended objects or (partly) unresolvable group targets raises new challenges for both data association and track maintenance. Due to limited sensor resoluti...
Michael Feldmann, Dietrich Fraenken