Sciweavers

2089 search results - page 221 / 418
» A New Problem in String Searching
Sort
View
JOTA
2011
149views more  JOTA 2011»
14 years 10 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
CP
2000
Springer
15 years 7 months ago
Extending Forward Checking
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Fahiem Bacchus
118
Voted
CCS
2006
ACM
15 years 7 months ago
Searchable symmetric encryption: improved definitions and efficient constructions
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail ...
CVPR
2004
IEEE
16 years 5 months ago
Multi-Scale Visual Tracking by Sequential Belief Propagation
A novel statistical method is proposed in this paper to overcome abrupt motion for robust visual tracking. Existing tracking methods that are based on the small motion assumption ...
Gang Hua, Ying Wu
CP
2007
Springer
15 years 9 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner