2004 search results - page 241 / 401 » Sampling from large graphs |
139
Voted
SMA
2003
ACM
15 years 8 months ago
2003
ACM
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
147
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
121
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
142
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
166
click to vote
COR
2008
15 years 3 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...