Sciweavers

3864 search results - page 738 / 773
» time 2005
Sort
View
CIVR
2005
Springer
154views Image Analysis» more  CIVR 2005»
14 years 1 months ago
A Novel Texture Descriptor Using Over-Complete Wavelet Transform and Its Fractal Signature
In the paper, we proposed a novel feature descriptor using over-complete wavelet transform and wavelet domain based fractal signature for texture image analysis and retrieval. Trad...
Qing Wang, David Dagan Feng
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 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
COCOON
2005
Springer
14 years 1 months ago
Share the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
Weizhao Wang, Xiang-Yang Li, Zheng Sun
CONCUR
2005
Springer
14 years 1 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
CP
2005
Springer
14 years 1 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell