Sciweavers

4526 search results - page 693 / 906
» Algorithmic problems related to the Internet
Sort
View
ANOR
2005
160views more  ANOR 2005»
15 years 4 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
ICC
2008
IEEE
115views Communications» more  ICC 2008»
15 years 11 months ago
Oblivious Routing for Wireless Mesh Networks
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
Jonathan Wellons, Yuan Xue
CCS
2007
ACM
15 years 8 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
CIKM
2010
Springer
15 years 2 months ago
A probabilistic topic-connection model for automatic image annotation
The explosive increase of image data on Internet has made it an important, yet very challenging task to index and automatically annotate image data. To achieve that end, sophistic...
Xin Chen, Xiaohua Hu, Zhongna Zhou, Caimei Lu, Gai...
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 4 months 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