Sciweavers

15073 search results - page 2605 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
WWW
2009
ACM
16 years 5 months ago
Seller's credibility in electronic markets: a complex network based approach
In the last decade, there has been an explosion of online commercial activity enabled by the World Wide Web. An electronic marketplace (e-market) provides an online method to perf...
Adriano M. Pereira, Arlei Silva, Wagner Meira Jr.,...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 5 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 5 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 5 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 11 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
« Prev « First page 2605 / 3015 Last » Next »