Sciweavers

1814 search results - page 67 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CBSE
2005
Springer
14 years 3 months ago
Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components
Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for ach...
Naiyana Tansalarak, Kajal T. Claypool
CSDA
2006
96views more  CSDA 2006»
13 years 10 months ago
Analysis of new variable selection methods for discriminant analysis
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...
Joaquín A. Pacheco, Silvia Casado, Laura N&...
ACL
2009
13 years 8 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
13 years 1 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
CAD
2005
Springer
13 years 10 months ago
Drawing curves onto a cloud of points for point-based modelling
Point-based geometric models are gaining popularity in both the computer graphics and CAD fields. A related design/modelling problem is the focus of the reported research: drawing...
Phillip N. Azariadis, Nickolas S. Sapidis