Sciweavers

3113 search results - page 259 / 623
» Numerical Methods
Sort
View
SMC
2007
IEEE
123views Control Systems» more  SMC 2007»
16 years 23 days ago
Logarithmic edge detection with applications
—In real world machine vision problems, numerous issues such as variable scene illumination make edge and object detection difficult. There exists no universal edge detection met...
Eric J. Wharton, Karen Panetta, Sos S. Agaian
APVIS
2009
15 years 7 months ago
Interactive feature extraction and tracking by utilizing region coherency
The ability to extract and follow time-varying flow features in volume data generated from large-scale numerical simulations enables scientists to effectively see and validate mod...
Chris Muelder, Kwan-Liu Ma
PROCEDIA
2010
75views more  PROCEDIA 2010»
15 years 4 months ago
Two derivative-free optimization algorithms for mesh quality improvement
High-quality meshes are essential in the solution of partial differential equations (PDEs), which arise in numerous science and engineering applications, as the mesh quality aff...
Jeonghyung Park, Suzanne M. Shontz
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 5 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth
TIT
2011
116views more  TIT 2011»
15 years 1 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth