Sciweavers

364 search results - page 3 / 73
» Very Efficient Balanced Codes
Sort
View
ECCV
2006
Springer
14 years 7 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
ADHOC
2008
122views more  ADHOC 2008»
13 years 5 months ago
Balancing computation and communication costs: The case for hybrid execution in sensor networks
Virtual machines (VM) are promising as system software in sensor networks. A major impediment to their widespread acceptance is their performance overhead. Compiling VM bytecode to...
Joel Koshy, Ingwar Wirjawan, Raju Pandey, Yann Ram...

Book
2145views
15 years 3 months ago
An Introduction to Binary Search Trees and Balanced Trees
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Ben Pfaff
GPC
2009
Springer
14 years 10 days ago
Efficient Parallelized Network Coding for P2P File Sharing Applications
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...
Karam Park, Joon-Sang Park, Won Woo Ro
TC
2008
13 years 5 months ago
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding ...
Cheng Huang, Lihao Xu