Sciweavers

1028 search results - page 166 / 206
» Measuring Distributional Similarity in Context
Sort
View
CMOT
2004
141views more  CMOT 2004»
13 years 8 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
ICPR
2008
IEEE
14 years 10 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ICML
2002
IEEE
14 years 9 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
ESOP
2009
Springer
14 years 3 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
INFOCOM
2009
IEEE
14 years 3 months ago
Physical Interference Modeling for Transmission Scheduling on Commodity WiFi Hardware
—The demand for capacity in WiFi networks is driving a new look at transmission scheduling based link layers, particularly in the context of mesh networks. One basic issue here i...
Ritesh Maheshwari, Jing Cao, Samir R. Das