Sciweavers

316 search results - page 25 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
ALGOSENSORS
2009
Springer
15 years 4 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
CGF
2005
159views more  CGF 2005»
14 years 9 months ago
Real-Time Shape Editing using Radial Basis Functions
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
Mario Botsch, Leif Kobbelt
JEA
2008
97views more  JEA 2008»
14 years 9 months ago
Approximating the true evolutionary distance between two genomes
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
ICDM
2006
IEEE
84views Data Mining» more  ICDM 2006»
15 years 3 months ago
Exploratory Under-Sampling for Class-Imbalance Learning
Under-sampling is a class-imbalance learning method which uses only a subset of major class examples and thus is very efficient. The main deficiency is that many major class exa...
Xu-Ying Liu, Jianxin Wu, Zhi-Hua Zhou
INFORMS
2000
54views more  INFORMS 2000»
14 years 9 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....