1369 search results - page 213 / 274 » Lattice computations for random numbers |
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Bag-of-features representations have recently become popular for content based image classification owing to their simplicity and good performance. They evolved from text...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
TCC
2007
Springer
14 years 3 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...