Sciweavers

793 search results - page 141 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ICCV
1999
IEEE
14 years 9 months ago
United Snakes
Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a framework called ``...
Jianming Liang, Tim McInerney, Demetri Terzopoulos
RECOMB
2004
Springer
14 years 7 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
AI
2008
Springer
13 years 7 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
13 years 5 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin