Sciweavers

2095 search results - page 109 / 419
» Improved pebbling bounds
Sort
View
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 2 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
202
Voted
APDC
1997
15 years 2 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
90
Voted
KAIS
2006
87views more  KAIS 2006»
15 years 22 days ago
Improving the performance of 1D object classification by using the Electoral College
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
Liang Chen, Ruoyu Chen, Sharmin Nilufar
DATESO
2009
119views Database» more  DATESO 2009»
14 years 10 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
101
Voted
DCC
2008
IEEE
16 years 11 days ago
Partial ovoids and partial spreads in hermitian polar spaces
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Sto...