Sciweavers

969 search results - page 140 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
PRL
2002
70views more  PRL 2002»
13 years 8 months ago
On the use of nearest feature line for speaker identification
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
Ke Chen 0001, Ting-Yao Wu, HongJiang Zhang
GI
2010
Springer
13 years 7 months ago
Estimating the Relevance of Search Results in the Culture-Web: A Study of Semantic Distance Measures
Abstract: More and more cultural heritage institutions publish their collections, vocabularies and metadata on the Web. The resulting Web of linked cultural data opens up exciting ...
Laura Hollink, Mark van Assem
ICDM
2010
IEEE
132views Data Mining» more  ICDM 2010»
13 years 6 months ago
Monotone Relabeling in Ordinal Classification
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...
Ad Feelders
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
14 years 1 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
PODC
2012
ACM
11 years 11 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...