561 search results - page 67 / 113 » Algorithms and applications for approximate nonnegative matr... |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
JAIR
1998
13 years 7 months ago
1998
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...