Sciweavers

16404 search results - page 929 / 3281
» A set coverage problem
Sort
View
ICALP
2009
Springer
16 years 2 months ago
Approximating Decision Trees with Multiway Branches
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
CSE
2009
IEEE
16 years 2 months ago
Self-Tuning the Parameter of Adaptive Non-linear Sampling Method for Flow Statistics
—Flow statistics is a basic task of passive measurement and has been widely used to characterize the state of the network. Adaptive Non-Linear Sampling (ANLS)is one of the most a...
Chengchen Hu, Bin Liu
ICASSP
2009
IEEE
16 years 2 months ago
Separable PCA for image classification
As an alternative to standard PCA, matrix-based image dimensionality reduction methods have recently been proposed and have gained attention due to reported computational efficie...
Yongxin Taylor Xi, Peter J. Ramadge
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
16 years 2 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
LOPSTR
2009
Springer
16 years 2 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...