1120 search results - page 118 / 224 » Making computer science minority-friendly |
137
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
149
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
150
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
137
click to vote
GI
2005
Springer
15 years 9 months ago
2005
Springer
: A distributed service to model and control contextual information in mobile and ubiquitous computing environments is presented in this paper. We introduce the general user model ...
173
Voted
WMASH
2004
ACM
15 years 9 months ago
2004
ACM
With the wide spread growth of mobile computing devices and local area wireless networks, wireless network providers have started to target the users with value-added services bas...