11231 search results - page 1758 / 2247 » Digging for Data Structures |
141
click to vote
HPDC
1999
IEEE
15 years 9 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
137
click to vote
KDD
1994
ACM
15 years 9 months ago
1994
ACM
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
164
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
138
click to vote
APGV
2010
ACM
15 years 9 months ago
2010
ACM
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...
167
Voted
KDD
2010
ACM
15 years 9 months ago
2010
ACM
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...