Sciweavers

13603 search results - page 318 / 2721
» On the Complexity of Computing Treelength
Sort
View
AIPS
2004
15 years 7 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
NA
2006
84views more  NA 2006»
15 years 6 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
CG
2004
Springer
15 years 6 months ago
A survey of point-based techniques in computer graphics
In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of...
Leif Kobbelt, Mario Botsch
MOBIHOC
2008
ACM
16 years 5 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang