Sciweavers

206 search results - page 36 / 42
» A distributed approximation algorithm for the minimum degree...
Sort
View
PPOPP
2011
ACM
12 years 10 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
IPPS
2005
IEEE
14 years 1 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
CVPR
2012
IEEE
11 years 10 months ago
City scale geo-spatial trajectory estimation of a moving camera
This paper presents a novel method for estimating the geospatial trajectory of a moving camera with unknown intrinsic parameters, in a city-scale urban environment. The proposed m...
Gonzalo Vaca-Castano, Amir Roshan Zamir, Mubarak S...
IJCNN
2000
IEEE
14 years 1 days ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
ICPP
2005
IEEE
14 years 1 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao