Sciweavers

17541 search results - page 3291 / 3509
» Complexity in scalable computing
Sort
View
SIGCOMM
2006
ACM
15 years 10 months ago
Building an AS-topology model that captures route diversity
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
VRCAI
2006
ACM
15 years 10 months ago
Parallel-split shadow maps for large-scale virtual environments
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
Fan Zhang, Hanqiu Sun, Leilei Xu, Lee Kit Lun
CVPR
2010
IEEE
15 years 10 months ago
Latent Hierarchical Structural Learning for Object Detection
We present a latent hierarchical structural learning method for object detection. An object is represented by a mixture of hierarchical tree models where the nodes represent objec...
Leo Zhu, Yuanhao Chen, Antonio Torralba, Alan Yuil...
ACSC
2005
IEEE
15 years 10 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
« Prev « First page 3291 / 3509 Last » Next »