Sciweavers

13180 search results - page 2389 / 2636
» Network Models
Sort
View
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 10 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
GD
2005
Springer
15 years 9 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 8 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
132
Voted
ICCV
1999
IEEE
15 years 8 months ago
Learning Low-Level Vision
We describe a learning-based method for low-level vision problems--estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images, m...
William T. Freeman, Egon C. Pasztor
HT
2007
ACM
15 years 8 months ago
Identifying subcommunities using cohesive subgroups in social hypertext
Web pages can be modeled as nodes in a social network, and hyperlinks between pages form links (relationships) between the nodes. Links may take the form of comments, for example ...
Alvin Chin, Mark H. Chignell
« Prev « First page 2389 / 2636 Last » Next »