Sciweavers

77 search results - page 15 / 16
» Enumeration Reducibility with Polynomial Time Bounds
Sort
View
CVPR
2007
IEEE
14 years 1 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
JCB
2006
115views more  JCB 2006»
13 years 7 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
ASIACRYPT
2009
Springer
14 years 2 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 7 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
INFOCOM
2012
IEEE
11 years 10 months ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...