Sciweavers

9810 search results - page 1661 / 1962
» Problems, Descriptions and Objects
Sort
View
CGO
2003
IEEE
15 years 10 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
ADHOCNETS
2009
Springer
15 years 9 months ago
Efficient Distribution of Large Files in UMTS Supported by Network Coded M2M Data Transfer with Multiple Generations
This paper is a sequel of previous work, in which we have studied the traffic management problem in UMTS. The main objective was to improve the spectral efficiency of cellular netw...
Larissa Popova, Wolfgang H. Gerstacker, Wolfgang K...
ICDCS
2010
IEEE
15 years 8 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
CP
2008
Springer
15 years 8 months ago
An Application of Constraint Programming to Superblock Instruction Scheduling
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
Abid M. Malik, Michael Chase, Tyrel Russell, Peter...
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 8 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
« Prev « First page 1661 / 1962 Last » Next »