1403 search results - page 119 / 281 » Set cover algorithms for very large datasets |
140
click to vote
INFOCOM
1994
IEEE
15 years 8 months ago
1994
IEEE
A new model of nonuniform traffic is introduced for a single-hop packet-switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the nu...
234
click to vote
VLDB
2001
ACM
16 years 4 months ago
2001
ACM
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
119
click to vote
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
155
Voted
IJCAI
2007
15 years 6 months ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
179
click to vote
CVPR
2009
IEEE
16 years 12 months ago
2009
IEEE
We present a new approach to robust pose-variant face
recognition, which exhibits excellent generalization ability
even across completely different datasets due to its weak
depe...