Sciweavers

4342 search results - page 371 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
CASES
2008
ACM
15 years 8 months ago
Reducing pressure in bounded DBT code caches
Dynamic binary translators (DBT) have recently attracted much attention for embedded systems. The effective implementation of DBT in these systems is challenging due to tight cons...
José Baiocchi, Bruce R. Childers, Jack W. D...
SIGIR
2004
ACM
16 years 8 days ago
Web-page classification through summarization
Web-page classification is much more difficult than pure-text classification due to a large variety of noisy information embedded in Web pages. In this paper, we propose a new Web...
Dou Shen, Zheng Chen, Qiang Yang, Hua-Jun Zeng, Be...
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
16 years 12 days ago
Optimized interval splitting in a linear scan register allocator
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems’ Java HotSpotTM client compiler. Linear scan register allocation is ...
Christian Wimmer, Hanspeter Mössenböck
SIGIR
2010
ACM
15 years 7 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano