Sciweavers

762 search results - page 7 / 153
» Finding Facilities Fast
Sort
View
DAM
2007
40views more  DAM 2007»
13 years 9 months ago
Finding submasses in weighted strings with Fast Fourier Transform
Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipt&aacu...
SIGECOM
2010
ACM
153views ECommerce» more  SIGECOM 2010»
13 years 8 months ago
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
Denis Charles, Max Chickering, Nikhil R. Devanur, ...
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
13 years 19 days ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda