Sciweavers

4565 search results - page 178 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 15 days ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
WSC
2008
15 years 2 months ago
Yard crane dispatching based on real time data driven simulation for container terminals
This paper studies the problem of real time yard crane dispatching in container terminals. Many technologies, including transponders, RFID and GPS have been used in the container ...
Xi Guo, Shell-Ying Huang, Wen-Jing Hsu, Malcolm Yo...
98
Voted
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 19 days ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
86
Voted
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 25 days ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
98
Voted
SIROCCO
2004
15 years 1 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin