Sciweavers

771 search results - page 150 / 155
» Efficient Web Searching Using Temporal Factors
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 5 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
16 years 4 days ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 7 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
143
Voted
WWW
2006
ACM
16 years 3 months ago
Large-scale text categorization by batch mode active learning
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
BMCBI
2008
129views more  BMCBI 2008»
15 years 3 months ago
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes
Background: Bacterial promoters, which increase the efficiency of gene expression, differ from other promoters by several characteristics. This difference, not yet widely exploite...
Michael Dekhtyar, Amelie Morin, Vehary Sakanyan