Sciweavers

4498 search results - page 708 / 900
» How to Invent Functions
Sort
View
KES
2006
Springer
15 years 4 months ago
Integrated Document Browsing and Data Acquisition for Building Large Ontologies
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
Felix Weigel, Klaus U. Schulz, Levin Brunner, Edua...
PAMI
2006
243views more  PAMI 2006»
15 years 4 months ago
Dynamical Statistical Shape Priors for Level Set-Based Tracking
In recent years, researchers have proposed to introduce statistical shape knowledge into level set based segmentation methods in order to cope with insufficient low-level informati...
Daniel Cremers
IJAR
2007
130views more  IJAR 2007»
15 years 4 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
SIAMJO
2008
114views more  SIAMJO 2008»
15 years 4 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
140
Voted
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 4 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl