Sciweavers

7796 search results - page 1304 / 1560
» On Generalized Schur Numbers
Sort
View
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 8 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 8 months 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...
ICWS
2009
IEEE
15 years 8 months ago
Reiki: Serviceability Architecture and Approach for Reduction and Management of Product Service Incidents
: © Reiki: Serviceability Architecture and Approach for Reduction and Management of Product Service Incidents Chris Connelly, Brian Cox, Tim Forell, Rui Liu, Dejan Milojicic, Alan...
Chris Connelly, Brian Cox, Tim Forell, Rui Liu, De...
EUROSYS
2007
ACM
15 years 8 months ago
Concierge: a service platform for resource-constrained devices
As mobile and embedded devices become widespread, the management and configuration of the software in the devices is increasingly turning into a critical issue. OSGi is a busines...
Jan S. Rellermeyer, Gustavo Alonso
ICCD
2007
IEEE
183views Hardware» more  ICCD 2007»
15 years 8 months ago
Constraint satisfaction in incremental placement with application to performance optimization under power constraints
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
Huan Ren, Shantanu Dutt
« Prev « First page 1304 / 1560 Last » Next »