Sciweavers

1760 search results - page 118 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ACSC
2005
IEEE
14 years 1 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
SCALESPACE
2009
Springer
14 years 2 months ago
Pre-image as Karcher Mean Using Diffusion Maps: Application to Shape and Image Denoising
In the context of shape and image modeling by manifold learning, we focus on the problem of denoising. A set of shapes or images being known through given samples, we capture its s...
Nicolas Thorstensen, Florent Ségonne, Renau...
BCB
2010
161views Bioinformatics» more  BCB 2010»
13 years 3 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
CCGRID
2004
IEEE
14 years 7 hour ago
A multi-path routing service for immersive environments
The Metaverse project aims to develop technology for low-cost, high-resolution networked immersive display environments that can be used for distributed collaboration, exploration...
Sherlia Shi, Lili Wang, Kenneth L. Calvert, Jim Gr...
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang