Sciweavers

2252 search results - page 262 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
134
Voted
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 3 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
129
Voted
ICPR
2008
IEEE
15 years 10 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
150
Voted
TKDE
2010
184views more  TKDE 2010»
15 years 2 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
137
Voted
IWQOS
2001
Springer
15 years 8 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell
118
Voted
CISS
2008
IEEE
15 years 10 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He