Sciweavers

5144 search results - page 419 / 1029
» Enhancing Search with Structure
Sort
View
192
Voted
AAAI
1996
15 years 8 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
175
Voted
IJAIT
2007
119views more  IJAIT 2007»
15 years 6 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
MVA
2002
15 years 6 months ago
A System for Locating License-plate Area from Images Taken under Complex Conditions
In this paper, an efficient edge-based approach, including implementation of a hardware system, for locating car license plate area from images taken under relatively complex cond...
Sunghoon Kim, Changsub Park, Gyeonghwan Kim
INFOCOM
2010
IEEE
15 years 5 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
ICCV
2007
IEEE
16 years 8 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas