Sciweavers

23413 search results - page 4409 / 4683
» or 2005
Sort
View
202
Voted
APN
2005
Springer
16 years 1 months ago
The ProM Framework: A New Era in Process Mining Tool Support
Under the umbrella of buzzwords such as “Business Activity Monitoring” (BAM) and “Business Process Intelligence” (BPI) both academic (e.g., EMiT, Little Thumb, InWoLvE, Pro...
Boudewijn F. van Dongen, Ana Karla A. de Medeiros,...
200
Voted
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
16 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
207
Voted
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 1 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
16 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
16 years 1 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
« Prev « First page 4409 / 4683 Last » Next »