Sciweavers

700 search results - page 110 / 140
» words 2005
Sort
View
TSD
2005
Springer
15 years 3 months ago
Why Is the Recognition of Spontaneous Speech so Hard?
Although speech, derived from reading texts, and similar types of speech, e.g. that from reading newspapers or that from news broadcast, can be recognized with high accuracy, recog...
Sadaoki Furui, Masanobu Nakamura, Tomohisa Ichiba,...
WEBI
2005
Springer
15 years 3 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
GD
2004
Springer
15 years 3 months ago
Partitions of Complete Geometric Graphs into Plane Trees
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Cam...
FC
2003
Springer
111views Cryptology» more  FC 2003»
15 years 2 months ago
Squealing Euros: Privacy Protection in RFID-Enabled Banknotes
Abstract. Thanks to their broad international acceptance and availability in high denominations, there is widespread concern that Euro banknotes may provide an attractive new curre...
Ari Juels, Ravikanth Pappu
FOSSACS
1999
Springer
15 years 1 months ago
Probabilistic Temporal Logics via the Modal Mu-Calculus
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
Murali Narasimha, Rance Cleaveland, S. Purushotham...