Sciweavers

463 search results - page 30 / 93
» The Most Reliable Subgraph Problem
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 11 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
CIKM
2010
Springer
14 years 8 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
130
Voted
CVPR
2004
IEEE
16 years 3 months ago
Point Matching as a Classification Problem for Fast and Robust Object Pose Estimation
We propose a novel approach to point matching under large viewpoint and illumination changes that is suitable for accurate object pose estimation at a much lower computational cos...
Vincent Lepetit, Julien Pilet, Pascal Fua
NETWORK
2006
96views more  NETWORK 2006»
15 years 1 months ago
Optimizing TCP and RLC interaction in the UMTS radio access network
TCP, the dominant transport protocol for Internet applications, suffers severe performance degradation due to packet losses when a wireless link is present in the endto-end path. ...
Juan J. Alcaraz, Fernando Cerdán, Joan Garc...
106
Voted
CVPR
2007
IEEE
16 years 3 months ago
Real-time Automatic Deceit Detection from Involuntary Facial Expressions
Being the most broadly used tool for deceit measurement, the polygraph is a limited method as it suffers from human operator subjectivity and the fact that target subjects are awa...
Zhi Zhang, Vartika Singh, Thomas E. Slowe, Sergey ...