Sciweavers

430 search results - page 5 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
MM
2006
ACM
152views Multimedia» more  MM 2006»
14 years 1 months ago
Local image representations using pruned salient points with applications to CBIR
Salient points are locations in an image where there is a significant variation with respect to a chosen image feature. Since the set of salient points in an image capture import...
Hui Zhang, Rouhollah Rahmani, Sharath R. Cholleti,...
GEM
2007
13 years 8 months ago
Searching for Snake-In-The-Box Codes With Evolved Pruning Models
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...
ANOR
2008
93views more  ANOR 2008»
13 years 7 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
ACL
1998
13 years 8 months ago
Error-Driven Pruning of Treebank Grammars for Base Noun Phrase Identification
Finding simple, non-recursive, base noun phrases is an important subtask for many natural language processing applications. While previous empirical methods for base NP identifica...
Claire Cardie, David R. Pierce
ANOR
2011
131views more  ANOR 2011»
13 years 2 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga