1369 search results - page 189 / 274 » Lattice computations for random numbers |
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
109
click to vote
ACL
2010
14 years 11 months ago
2010
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
132
click to vote
NAACL
2010
14 years 11 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
128
click to vote
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
139
Voted
IEEESCC
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...