2485 search results - page 72 / 497 » Time Bounded Frequency Computations |
150
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
109
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
111
click to vote
MCU
2007
15 years 5 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
125
click to vote
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...