Sciweavers

553 search results - page 81 / 111
» Cover Contact Graphs
Sort
View
102
Voted
CCR
2010
184views more  CCR 2010»
14 years 10 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
EDBT
2004
ACM
133views Database» more  EDBT 2004»
15 years 10 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
120
Voted
CVPR
2010
IEEE
1413views Computer Vision» more  CVPR 2010»
15 years 6 months ago
Free-Shape Subwindow Search for Object Localization
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...
Zhiqi Zhang, Yu Cao, Dhaval Salvi, Kenton Oliver, ...
114
Voted
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 3 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
IPMU
1992
Springer
15 years 2 months ago
Rule-Based Systems with Unreliable Conditions
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
L. Cardona, Jürg Kohlas, Paul-André Mo...