Sciweavers

6110 search results - page 376 / 1222
» Approximate Computing
Sort
View
TKDE
2010
195views more  TKDE 2010»
15 years 5 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
ICPR
2008
IEEE
16 years 8 months ago
K-means clustering of proportional data using L1 distance
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...
IMR
2003
Springer
15 years 12 months ago
Geodesic-based Surface Remeshing
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
Oren Sifri, Alla Sheffer, Craig Gotsman
DCOSS
2008
Springer
15 years 8 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
IJCSA
2007
110views more  IJCSA 2007»
15 years 6 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari