Sciweavers

333 search results - page 30 / 67
» Computation with Absolutely No Space Overhead
Sort
View
OOPSLA
2007
Springer
14 years 4 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
CLUSTER
2004
IEEE
14 years 1 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 9 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
CHI
2006
ACM
14 years 10 months ago
Navigating persistent audio
This paper gives an overview of RadioActive, a largescale asynchronous audio messaging platform for mobile devices. It supports persistent chat spaces that allow users to engage i...
Aaron Zinman, Judith S. Donath
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 4 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki