Sciweavers

518 search results - page 91 / 104
» Beating a Random Assignment
Sort
View
SIGSOFT
1995
ACM
15 years 3 months ago
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
Adam A. Porter, Harvey P. Siy, Carol A. Toman, Law...
BMCBI
2010
154views more  BMCBI 2010»
14 years 12 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
MST
2006
136views more  MST 2006»
14 years 11 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
16 years 1 days ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
ICIP
2002
IEEE
16 years 1 months ago
A method for color naming and description of color composition in images
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
Aleksandra Mojsilovic