Sciweavers

1855 search results - page 233 / 371
» A coding theorem for distributed computation
Sort
View
CONCURRENCY
2008
83views more  CONCURRENCY 2008»
15 years 4 months ago
A definition of and linguistic support for partial quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
139
Voted
MSR
2006
ACM
15 years 10 months ago
Micro pattern evolution
When analyzing the evolution history of a software project, we wish to develop results that generalize across projects. One approach is to analyze design patterns, permitting char...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
CODES
2005
IEEE
15 years 9 months ago
Aggregating processor free time for energy reduction
Even after carefully tuning the memory characteristics to the application properties and the processor speed, during the execution of real applications there are times when the pr...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
15 years 8 months ago
Automatic contention detection and amelioration for data-intensive operations
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
John Cieslewicz, Kenneth A. Ross, Kyoho Satsumi, Y...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 2 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang