Sciweavers

864 search results - page 102 / 173
» A general markov framework for page importance computation
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CVPR
2011
IEEE
13 years 4 months ago
Intrinsic Dense 3D Surface Tracking
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
Yun Zeng, Chaohui Wang, Yang Wang, David Gu, Dimit...
ICS
2007
Tsinghua U.
14 years 3 months ago
Optimization and bottleneck analysis of network block I/O in commodity storage systems
Building commodity networked storage systems is an important architectural trend; Commodity servers hosting a moderate number of consumer-grade disks and interconnected with a hig...
Manolis Marazakis, Vassilis Papaefstathiou, Angelo...
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 2 months ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
INFOCOM
2008
IEEE
14 years 3 months ago
Network Routing Topology Inference from End-to-End Measurements
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...