Sciweavers

1439 search results - page 87 / 288
» Fast approximation of centrality
Sort
View
TOG
2010
129views more  TOG 2010»
14 years 4 months ago
Optical computing for fast light transport analysis
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
Matthew O'Toole, Kiriakos N. Kutulakos
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
15 years 4 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
ICCCN
1998
IEEE
15 years 2 months ago
Fast Recovery Protocol for Database and Link Failures in Mobile Networks
An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. The current IS-41 standard P C S arc...
Govind Krishnamurthi, Stefano Chessa, Arun K. Soma...
MOBIDE
2005
ACM
15 years 3 months ago
Video-streaming for fast moving users in 3G mobile networks
The emergence of third-generation (3G) mobile networks offers new opportunities for the effective delivery of data with rich content including multimedia messaging and video-strea...
Anna Kyriakidou, Nikos Karelos, Alex Delis