95 search results - page 19 / 19 » Approximation of Natural W[P]-Complete Minimisation Problems... |
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
IPSN
2010
Springer
14 years 4 days ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
MM
2004
ACM
13 years 10 months ago
2004
ACM
Approximately 2 degrees in our 140 degree vision span has sharp vision. Many researchers have been fascinated by the idea of eyetracking integrated perceptual compression of an im...
CPHYSICS
2006
13 years 5 months ago
2006
A computer program is described to calculate momentum distributions in stripping and diffraction dissociation reactions. A Glauber model is used with the scattering wavefunctions ...