9176 search results - page 261 / 1836 » algorithms 2010 |
161
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, s...
182
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
187
click to vote
SIAMDM
2010
15 years 1 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
180
click to vote
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
165
click to vote
UIST
2010
ACM
15 years 4 months ago
2010
ACM
Mechanical Turk provides an on-demand source of human computation. This provides a tremendous opportunity to explore algorithms which incorporate human computation as a function c...