Sciweavers

317 search results - page 16 / 64
» Computing and Updating the Process Number in Trees
Sort
View
PARELEC
2002
IEEE
15 years 4 months ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
INFOCOM
2002
IEEE
15 years 4 months ago
Efficient Dissemination of Personalized Information Using Content-Based Multicast
There has been a surge of interest in the delivery of personalized information to users (e.g. personalized stocks or travel information), particularly as mobile users with limited ...
Rahul Shah, Ravi Jain, Farooq Anjum
CGI
1998
IEEE
15 years 4 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
CVIU
2011
14 years 6 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
APSEC
2001
IEEE
15 years 3 months ago
Orchestrating Computations on the World-Wide Web
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
Jayadev Misra, Harrick M. Vin