Sciweavers

848 search results - page 145 / 170
» Randomness and the linear degrees of computability
Sort
View
AAAI
2008
15 years 2 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 1 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
COR
2006
113views more  COR 2006»
14 years 11 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
CN
2007
154views more  CN 2007»
14 years 11 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
PAMI
2006
146views more  PAMI 2006»
14 years 11 months ago
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
Tamar Avraham, Michael Lindenbaum