Sciweavers

2880 search results - page 307 / 576
» Approximate Range Searching
Sort
View
116
Voted
DKE
2008
72views more  DKE 2008»
15 years 3 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
132
Voted
CN
2006
83views more  CN 2006»
15 years 3 months ago
A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms
This paper presents an assessment of the communication overheads of IPsec and evaluates the feasibility of deploying it on handheld devices for the UMTS architecture. A wide range...
Christos Xenakis, Nikolaos Laoutaris, Lazaros F. M...
117
Voted
IJCV
2006
115views more  IJCV 2006»
15 years 3 months ago
An Analysis of Linear Subspace Approaches for Computer Vision and Pattern Recognition
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
Pei Chen, David Suter
IJWIN
2006
209views more  IJWIN 2006»
15 years 3 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
142
Voted
CORR
2007
Springer
134views Education» more  CORR 2007»
15 years 3 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan