Sciweavers

7930 search results - page 1459 / 1586
» Greedy in Approximation Algorithms
Sort
View
CORR
2000
Springer
84views Education» more  CORR 2000»
15 years 3 months ago
Using a Diathesis Model for Semantic Parsing
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
Jordi Atserias, Irene Castellón, Montse Civ...
INFORMS
2000
54views more  INFORMS 2000»
15 years 3 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
PR
2000
158views more  PR 2000»
15 years 3 months ago
Applying deformable templates for cell image segmentation
This paper presents an automatic method, based on the deformable template approach, for cell image segmentation under severe noise conditions. We de"ne a new methodology, div...
Antonio Garrido Carrillo, Nicolas Pérez de ...
RC
2000
99views more  RC 2000»
15 years 3 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
IJIG
2002
189views more  IJIG 2002»
15 years 3 months ago
Motion Detection from Time-Varied Background
This paper proposes a new background subtraction method for detecting moving objects from a time-varied background. While background subtraction has traditionally worked well for ...
Ying Ren, Chin-Seng Chua, Yeong-Khing Ho
« Prev « First page 1459 / 1586 Last » Next »