Sciweavers

7930 search results - page 620 / 1586
» Greedy in Approximation Algorithms
Sort
View
CIAC
2010
Springer
194views Algorithms» more  CIAC 2010»
16 years 2 days ago
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Hui Zhang, Qing Guo, Costas S. Iliopoulos
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
15 years 11 months ago
Towards a universal test suite for combinatorial auction algorithms
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
NIPS
2007
15 years 8 months ago
Topmoumoute Online Natural Gradient Algorithm
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
Nicolas Le Roux, Pierre-Antoine Manzagol, Yoshua B...
CGVR
2006
15 years 8 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
IJRR
2007
60views more  IJRR 2007»
15 years 7 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides