Sciweavers

1612 search results - page 255 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
CVPR
2012
IEEE
13 years 7 days 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...
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 3 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ANSS
2006
IEEE
15 years 3 months ago
Performance Study of End-to-End Traffic-Aware Routing
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
Raad S. Al-Qassas, Lewis M. Mackenzie, Mohamed Oul...
BMCBI
2007
149views more  BMCBI 2007»
14 years 10 months ago
A unified framework for finding differentially expressed genes from microarray experiments
Background: This paper presents a unified framework for finding differentially expressed genes (DEGs) from the microarray data. The proposed framework has three interrelated modul...
Jahangheer S. Shaik, Mohammed Yeasin