Sciweavers

2107 search results - page 160 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
162
Voted
PERCOM
2005
ACM
16 years 3 months ago
Efficient Browsing of Web Search Results on Mobile Devices Based on Block Importance Model
It is expected that more and more people will search the web when they are on the move. Though conventional search engines can be directly visited from mobile devices with web bro...
Xing Xie, Gengxin Miao, Ruihua Song, Ji-Rong Wen, ...
110
Voted
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
15 years 9 months ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
153
Voted
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 10 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
VISUALIZATION
2005
IEEE
15 years 9 months ago
Rendering Tetrahedral Meshes with Higher-Order Attenuation Functions for Digital Radiograph Reconstruction
This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functio...
Ofri Sadowsky, Jonathan D. Cohen, Russell H. Taylo...
ECCV
2004
Springer
16 years 5 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses