Sciweavers

2254 search results - page 239 / 451
» Computing the minimal covering set
Sort
View
IEEESCC
2009
IEEE
15 years 4 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
ICPR
2008
IEEE
16 years 7 months ago
Dynamic target classification in wireless sensor networks
Feature extraction and classification are two important components in pattern recognition. In this paper, we propose dynamic target classification in WSNs. The main idea of this a...
Ying Sun, Hairong Qi
CVPR
2010
IEEE
16 years 2 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
EGH
2004
Springer
16 years 1 days ago
Tile-based texture mapping on graphics hardware
Texture mapping has been a fundamental feature for commodity graphics hardware. However, a key challenge for texture mapping is how to store and manage large textures on graphics ...
Li-Yi Wei
NIPS
1998
15 years 8 months ago
Semi-Supervised Support Vector Machines
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
Kristin P. Bennett, Ayhan Demiriz