Sciweavers

18306 search results - page 339 / 3662
» Algorithmics in Exponential Time
Sort
View
SIAMSC
2008
111views more  SIAMSC 2008»
15 years 6 months ago
Revisiting the Crowding Phenomenon in Schwarz-Christoffel Mapping
We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in so...
L. Banjai
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 11 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
206
Voted
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
15 years 10 months ago
A resource--efficient time estimation for wireless sensor networks
We study the problem of providing a sensor node with an accurate estimate of the current time, from a novel prospective which is complementary to the well
Daniela Tulone
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
15 years 8 months ago
The cover time of sparse random graphs
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
Colin Cooper, Alan M. Frieze
ICML
2007
IEEE
16 years 7 months ago
Solving multiclass support vector machines with LaRank
Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optim...
Antoine Bordes, Jason Weston, Léon Bottou, ...