Sciweavers

5771 search results - page 870 / 1155
» Learning similarity space
Sort
View
IRES
2002
63views more  IRES 2002»
15 years 7 months ago
The Semantic Web, universalist ambition and some lessons from librarianship
Building the semantic web encounters problems similar to building large bibliographic systems. The experience of librarianship in controlling large, heterogeneous collections of b...
Terrence A. Brooks
214
Voted
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
198
Voted
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 7 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
VC
1998
66views more  VC 1998»
15 years 7 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet
216
Voted
ECCV
2008
Springer
16 years 9 months ago
Cross-View Action Recognition from Temporal Self-similarities
This paper concerns recognition of human actions under view changes. We explore self-similarities of action sequences over time and observe the striking stability of such measures ...
Imran N. Junejo, Emilie Dexter, Ivan Laptev, Patri...