Sciweavers

5115 search results - page 734 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
15 years 6 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
PAMI
2007
197views more  PAMI 2007»
15 years 6 months ago
A Lattice-Based MRF Model for Dynamic Near-Regular Texture Tracking
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...
Wen-Chieh Lin, Yanxi Liu
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 5 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
ICRA
2010
IEEE
141views Robotics» more  ICRA 2010»
15 years 5 months ago
Cloth grasp point detection based on multiple-view geometric cues with application to robotic towel folding
Abstract— We present a novel vision-based grasp point detection algorithm that can reliably detect the corners of a piece of cloth, using only geometric cues that are robust to v...
Jeremy Maitin-Shepard, Marco Cusumano-Towner, Jinn...
SIGOPS
2010
127views more  SIGOPS 2010»
15 years 4 months ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...