3008 search results - page 384 / 602 » Independence in connected graphs |
189
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
171
click to vote
NIPS
2008
15 years 8 months ago
2008
Consider data consisting of pairwise measurements, such as presence or absence of links between pairs of objects. These data arise, for instance, in the analysis of protein intera...
207
click to vote
BILDMED
2006
15 years 8 months ago
2006
Abstract. The proposed algorithm has been developed as a pre-processing tool for inflating cortical surface meshes, which have been created using segmentation and subsequent triang...
187
click to vote
AAAI
1992
15 years 8 months ago
1992
An intelligent agent uses known facts, including statistical knowledge, to assign degrees of belief to assertions it is uncertain about. We investigate three principled techniques...
195
Voted
ADT
2005
15 years 6 months ago
2005
In this paper we present a new framework, based on subdivision surface approximation, for efficient compression and coding of 3D models represented by polygonal meshes. Our algorit...