Sciweavers

1529 search results - page 196 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ICIP
2006
IEEE
16 years 5 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su
COLING
2002
15 years 3 months ago
Effective Structural Inference for Large XML Documents
This paper investigates methods to automatically infer structural information from large XML documents. Using XML as a reference format, we approach the schema generation problem ...
Jason Sankey, Raymond K. Wong
SIAMAM
2008
131views more  SIAMAM 2008»
15 years 4 months ago
Asymptotic and Numerical Techniques for Resonances of Thin Photonic Structures
We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable die...
J. Gopalakrishnan, S. Moskow, F. Santosa
145
Voted
AAAI
2004
15 years 5 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
TCAD
2008
106views more  TCAD 2008»
15 years 4 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan