Sciweavers

358 search results - page 39 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
3DPVT
2004
IEEE
159views Visualization» more  3DPVT 2004»
15 years 5 months ago
Dense Multiple View Stereo with General Camera Placement using Tensor Voting
We present a computational framework for the inference of dense descriptions from multiple view stereo with general camera placement. Thus far research on dense multiple view ster...
Philippos Mordohai, Gérard G. Medioni
APPT
2007
Springer
15 years 8 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
IPPS
2009
IEEE
15 years 8 months ago
Efficient microarchitecture policies for accurately adapting to power constraints
In the past years Dynamic Voltage and Frequency Scaling (DVFS) has been an effective technique that allowed microprocessors to match a predefined power budget. However, as process...
Juan M. Cebrian, Juan L. Aragón, José...
ACCV
2006
Springer
15 years 8 months ago
Fusion of 3D and Appearance Models for Fast Object Detection and Pose Estimation
Real-time estimation of a camera’s pose relative to an object is still an open problem. The difficulty stems from the need for fast and robust detection of known objects in the s...
Hesam Najafi, Yakup Genc, Nassir Navab
111
Voted
ISPAN
2005
IEEE
15 years 7 months ago
A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
Kevin F. Chen, Edwin Hsing-Mean Sha, S. Q. Zheng