1998 search results - page 363 / 400 » Complexity of the Cover Polynomial |
101
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria tog...
113
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
117
click to vote
SIGIR
2011
ACM
14 years 3 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
177
Voted
GIS
2004
ACM
16 years 1 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...