Sciweavers

3265 search results - page 192 / 653
» Representing Groups on Graphs
Sort
View
IPPS
1997
IEEE
15 years 8 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
ECIR
2008
Springer
15 years 5 months ago
Use of Implicit Graph for Recommending Relevant Videos: A Simulated Evaluation
In this paper, we propose a model for exploiting community based usage information for video retrieval. Implicit usage information from a pool of past users could be a valuable sou...
David Vallet, Frank Hopfgartner, Joemon M. Jose
WWW
2004
ACM
16 years 5 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
WMCSA
2002
IEEE
15 years 9 months ago
Context Aggregation and Dissemination in Ubiquitous Computing Systems
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...
Guanling Chen, David Kotz
HPCN
2000
Springer
15 years 8 months ago
Data Futures in DISCWorld
Data futures in a metacomputing system refer to data products that have not yet been created but which can be uniquely named and manipulated. We employ data flow mechanisms expres...
Heath A. James, Kenneth A. Hawick