Sciweavers

620 search results - page 76 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ICOIN
2003
Springer
15 years 5 months ago
Scalable IP Routing Lookup in Next Generation Network
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering...
Chia-Tai Chan, Pi-Chung Wang, Shuo-Cheng Hu, Chung...
SIGGRAPH
2010
ACM
15 years 4 months ago
Non-local scan consolidation for 3D urban scenes
Recent advances in scanning technologies, in particular devices that extract depth through active sensing, allow fast scanning of urban scenes. Such rapid acquisition incurs imper...
Qian Zheng, Andrei Sharf, Guowei Wan, Yangyan Li, ...
CVPR
2010
IEEE
15 years 4 months ago
Cascaded Pose Regression
We present a fast and accurate algorithm for computing the 2D pose of objects in images called cascaded pose regression (CPR). CPR progressively refines a loosely specified initia...
Piotr Dollar, Peter Welinder, Pietro Perona
DAC
2005
ACM
15 years 1 months ago
Piece-wise approximations of RLCK circuit responses using moment matching
Capturing RLCK circuit responses accurately with existing model order reduction (MOR) techniques is very expensive. Direct metrics for fast analysis of RC circuits exist but there...
Chirayu S. Amin, Yehea I. Ismail, Florentin Dartu
NOMS
2010
IEEE
136views Communications» more  NOMS 2010»
14 years 10 months ago
Supporting System-wide Similarity Queries for networked system management
Abstract— Today’s networked systems are extensively instrumented for collecting a wealth of monitoring data. In this paper, we propose a framework called System-wide Similarity...
Songyun Duan, Hui Zhang 0002, Guofei Jiang, Xiaoqi...