Sciweavers

3116 search results - page 55 / 624
» Recovering
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
RECOMB
2001
Springer
14 years 8 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
ISMIS
2009
Springer
14 years 2 months ago
A General Framework for Revising Belief Bases Using Qualitative Jeffrey's Rule
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to uncertain inputs, is used to re...
Salem Benferhat, Didier Dubois, Henri Prade, Mary-...
CDC
2008
IEEE
14 years 2 months ago
Wireless control of passive systems subject to actuator constraints
Abstract— Actuator constraints such as saturation can impose severe constraints on networked control systems. For instance delays in wireless control systems of unstable plants c...
Nicholas Kottenstette, Panos J. Antsaklis
ICPR
2008
IEEE
14 years 2 months ago
Shape from self-calibration and Fast Marching Method
Shape-from-shading methods recover 3-D shape from intensity images. Often, Lambertian reflectance is assumed. The Lambertian assumption is attractive because it simplifies the a...
Yuji Iwahori, Takashi Nakagawa, Robert J. Woodham,...