Sciweavers

87 search results - page 15 / 18
» Events on the edge
Sort
View
SPAA
2005
ACM
14 years 27 days ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
COMPGEOM
2010
ACM
14 years 13 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 9 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
BMCBI
2010
117views more  BMCBI 2010»
13 years 7 months ago
Using jackknife to assess the quality of gene order phylogenies
Background: In recent years, gene order data has attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. If ge...
Jian Shi, Yiwei Zhang, Haiwei Luo, Jijun Tang
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 9 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...