Sciweavers

1096 search results - page 29 / 220
» Partial Evaluation of Pointcuts
Sort
View
DATAMINE
2006
157views more  DATAMINE 2006»
13 years 7 months ago
Data Clustering with Partial Supervision
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...
Abdelhamid Bouchachia, Witold Pedrycz
CVIU
2004
143views more  CVIU 2004»
13 years 7 months ago
Shape matching of partially occluded curves invariant under projective transformation
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
Carlos Orrite, José Elías Herrero Ja...
AAAI
1994
13 years 8 months ago
Learning Explanation-Based Search Control Rules for Partial Order Planning
This paper presents snlp+ebl, the first implementation of explanation based learning techniques for a partial order planner. We describe the basic learning framework of snlp+ebl, ...
Suresh Katukam, Subbarao Kambhampati
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
13 years 9 months ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger
CIKM
2005
Springer
14 years 1 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima