Sciweavers

8671 search results - page 1705 / 1735
» A generator for hierarchical problems
Sort
View
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 8 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
CN
2007
149views more  CN 2007»
13 years 8 months ago
Adaptive congestion protocol: A congestion control protocol with learning capability
There is strong evidence that the current implementation of TCP will perform poorly in future high speed networks. To address this problem many congestion control protocols have b...
Marios Lestas, Andreas Pitsillides, Petros A. Ioan...
IJCV
2006
161views more  IJCV 2006»
13 years 8 months ago
Discriminative Random Fields
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
Sanjiv Kumar, Martial Hebert
JC
2008
128views more  JC 2008»
13 years 8 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
JCIT
2008
138views more  JCIT 2008»
13 years 8 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
« Prev « First page 1705 / 1735 Last » Next »