Sciweavers

177 search results - page 9 / 36
» Geometric Applications of a Randomized Optimization Techniqu...
Sort
View
DCC
2010
IEEE
13 years 5 months ago
Optimization of Overlapped Tiling for Efficient 3D Image Retrieval
Remote visualization of an arbitrary 2-D planar "cut" from a large volumetric dataset with random access has both gained importance and posed significant challenges over...
Zihong Fan, Antonio Ortega
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
DAGM
2008
Springer
13 years 9 months ago
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
Filip Korc, Wolfgang Förstner
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 2 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
JCO
1998
136views more  JCO 1998»
13 years 7 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...