Sciweavers

780 search results - page 150 / 156
» Cost-Sharing Approximations for h
Sort
View
EJC
2007
14 years 11 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
SIGIR
2008
ACM
14 years 11 months ago
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
Wei Dong, Moses Charikar, Kai Li
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
IJRR
2007
104views more  IJRR 2007»
14 years 11 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
97
Voted
BMCBI
2005
150views more  BMCBI 2005»
14 years 11 months ago
Discover protein sequence signatures from protein-protein interaction data
Background: The development of high-throughput technologies such as yeast two-hybrid systems and mass spectrometry technologies has made it possible to generate large protein-prot...
Jianwen Fang, Ryan J. Haasl, Yinghua Dong, Gerald ...