Sciweavers

12148 search results - page 2211 / 2430
» Generalized Bundle Methods
Sort
View
135
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 1 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
134
Voted
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
16 years 25 days ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
115
Voted
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 25 days ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
148
Voted
SPAA
2009
ACM
16 years 24 days ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
141
Voted
EUROSYS
2008
ACM
16 years 22 days ago
Protectit: trusted distributed services operating on sensitive data
Protecting shared sensitive information is a key requirement for today’s distributed applications. Our research uses virtualization technologies to create and maintain trusted d...
Jiantao Kong, Karsten Schwan, Min Lee, Mustaque Ah...
« Prev « First page 2211 / 2430 Last » Next »