Sciweavers

503 search results - page 70 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
116
Voted
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
15 years 8 months ago
OVSF-CDMA code assignment in wireless ad hoc networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
WAIM
2007
Springer
15 years 9 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
15 years 3 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
108
Voted
PAMI
1998
76views more  PAMI 1998»
15 years 3 months ago
Segmenting Images Corrupted by Correlated Noise
—Image segmentation is fundamental to many image analysis problems. It aims to partition a digital image into a set of nonoverlapping homogeneous regions. The main contribution o...
Thomas C. M. Lee
145
Voted
CIE
2007
Springer
15 years 9 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond