Sciweavers

4850 search results - page 754 / 970
» Approximate Data Structures with Applications
Sort
View
TSE
2010
136views more  TSE 2010»
15 years 3 months ago
A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
Mark Harman, Phil McMinn
GI
2009
Springer
15 years 2 months ago
Ontological Modelling of Surgical Knowledge
: Computer Assisted Surgery seeks data from various sources related to surgical knowledge, which is mostly represented in the form of discrete databases. However, databases serve a...
Raj Mudunuri, Oliver Burgert, Thomas Neumuth
ICCV
2009
IEEE
15 years 2 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
CVPR
2012
IEEE
13 years 7 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
ICCV
2009
IEEE
16 years 9 months ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu