Sciweavers

7379 search results - page 995 / 1476
» How Many Clusters
Sort
View
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
16 years 4 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
ICWS
2009
IEEE
16 years 4 months ago
Integrating Behavioral Trust in Web Service Compositions
Algorithms for composing Web services (WS) traditionally utilize the functional and quality-of-service parameters of candidate services to decide which services to include in the ...
Sharon Paradesi, Prashant Doshi, Sonu Swaika
ICCD
2002
IEEE
128views Hardware» more  ICCD 2002»
16 years 4 months ago
Subword Sorting with Versatile Permutation Instructions
Subword parallelism has succeeded in accelerating many multimedia applications. Subword permutation instructions have been proposed to efficiently rearrange subwords in or among r...
Zhijie Shi, Ruby B. Lee
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
16 years 4 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
SOFSEM
2009
Springer
16 years 4 months ago
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
David C. Parkes