Sciweavers

4498 search results - page 138 / 900
» How to Invent Functions
Sort
View
TCS
2002
13 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
JMLR
2012
12 years 20 days ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
SERP
2004
13 years 11 months ago
Using Clustering Technique to Restructure Programs
Program restructuring or refactoring is often required when a function becomes too large or is involved in multiple activities and therefore exhibits low cohesion. A critical fact...
Chung-Horng Lung, Marzia Zaman
AUTOMATICA
2008
96views more  AUTOMATICA 2008»
13 years 10 months ago
Nonlinear gliding stability and control for vehicles with hydrodynamic forcing
This paper presents Lyapunov functions for proving stability of steady gliding motions for vehicles with hydrodynamic or aerodynamic forces and moments. Because of lifting forces ...
Pradeep Bhatta, Naomi Ehrich Leonard
ECCV
1996
Springer
15 years 2 days ago
Image Recognition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
Tyng-Luh Liu, Michael J. Donahue, Davi Geiger, Rob...