Sciweavers

1161 search results - page 144 / 233
» Approximation schemes for clustering problems
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
CHI
2008
ACM
14 years 8 months ago
AutoCardSorter: designing the information architecture of a web site using latent semantic analysis
In this paper, we describe an innovative tool that supports the design and evaluation of the information architecture of a Web site. The tool uses Latent Semantic Analysis and hie...
Christos Katsanos, Nikolaos K. Tselios, Nikolaos M...
GLOBECOM
2009
IEEE
14 years 2 months ago
A Suboptimal Network Utility Maximization Approach for Scalable Multimedia Applications
—Wired and wireless data networks have witnessed an explosive growth of inelastic traffics such as real-time or media streaming applications. Recently, applications relying on l...
Mohammad Sadegh Talebi, Ahmad Khonsari, Mohammad H...
CLUSTER
2004
IEEE
13 years 7 months ago
A Synchronous Co-Allocation Mechanism for Grid Computing Systems
Grid computing systems are emerging as a computing infrastructure that will enable the use of wide-area network computing systems for a variety of challenging applications. One of ...
Farag Azzedin, Muthucumaru Maheswaran, Neil Arnaso...
ICML
2005
IEEE
14 years 8 months ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel