Sciweavers

3946 search results - page 534 / 790
» The computational complexity of choice sets
Sort
View
CIKM
2000
Springer
15 years 11 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
AGP
1999
IEEE
15 years 11 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
ICEIS
1999
IEEE
15 years 11 months ago
Contour Estimation on Piecewise Homogeneous Random Fields
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
José A. Moinhos Cordeiro, José M. B....
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 11 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
ICMCS
1997
IEEE
102views Multimedia» more  ICMCS 1997»
15 years 11 months ago
Fast Signature-Based Color-Spatial Image Retrieval
This paper presents a novel method of retrieving images based on color-spatial information. For each image, its color-spatial information is compactly captured by a set of color s...
Tat-Seng Chua, Kian-Lee Tan, Beng Chin Ooi