10996 search results - page 330 / 2200 » Future Directions in Computing |
172
click to vote
STOC
2003
ACM
16 years 7 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 ...
264
click to vote
BVAI
2007
Springer
16 years 26 days ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
222
click to vote
WMCSA
2002
IEEE
15 years 11 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
129
click to vote
IWEC
2007
15 years 8 months ago
2007
Abstract. We are exploring an application for a novel direction in humancomputer interaction named ‘cultural computing’, which aims to provide a new medium for cultural transla...
124
click to vote
CCCG
2004
15 years 8 months ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...