9736 search results - page 21 / 1948 » How Fast Can We Compute Products |
138
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
136
click to vote
IUI
2012
ACM
13 years 12 months ago
2012
ACM
Recent computer vision approaches are aimed at richer image interpretations that extend the standard recognition of objects in images (e.g., cars) to also recognize object attribu...
126
click to vote
NRHM
2008
15 years 4 months ago
2008
In the same way that Wikis have become the mechanism that has enabled groups of users to collaborate on the production of hypertexts on the web, Semantic Wikis promise a future of...
141
click to vote
GRID
2008
Springer
15 years 5 months ago
2008
Springer
Large scale production computing grids introduce new challenges in debugging and troubleshooting. A user that submits a workload consisting of tens of thousands of jobs to a grid ...
161
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...