Sciweavers

3019 search results - page 171 / 604
» Approximating the Domatic Number
Sort
View
NIPS
2004
15 years 7 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 6 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
COCOON
2005
Springer
15 years 12 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
VISUALIZATION
1996
IEEE
15 years 10 months ago
Mesh Reduction with Error Control
In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate ...
Reinhard Klein, Gunther Liebich, Wolfgang Stra&szl...
BMCBI
2010
160views more  BMCBI 2010»
15 years 1 months ago
eHive: An Artificial Intelligence workflow system for genomic analysis
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
Jessica Severin, Kathryn Beal, Albert J. Vilella, ...