Sciweavers

446 search results - page 88 / 90
» A Combinatorial Theorem for Trees
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 9 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 3 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
120
Voted
BMCBI
2010
121views more  BMCBI 2010»
14 years 11 months ago
MS4 - Multi-Scale Selector of Sequence Signatures: An alignment-free method for classification of biological sequences
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...
EOR
2007
198views more  EOR 2007»
14 years 11 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
103
Voted
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 11 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...