Sciweavers

15073 search results - page 2747 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
INFOCOM
2002
IEEE
15 years 8 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
SCAM
2002
IEEE
15 years 8 months ago
Precise Call Graph Construction in the Presence of Function Pointers
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 8 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
15 years 8 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan
120
Voted
CPAIOR
2010
Springer
15 years 8 months ago
Constraint-Based Local Search for Constrained Optimum Paths Problems
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry...
« Prev « First page 2747 / 3015 Last » Next »