Sciweavers

306 search results - page 12 / 62
» Fault-Tolerant Computation in the Full Information Model
Sort
View
ICDAR
2007
IEEE
13 years 11 months ago
On Computing Strength of Evidence for Writer Verification
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....
NAACL
2010
13 years 5 months ago
Constraint-Driven Rank-Based Learning for Information Extraction
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
Sameer Singh, Limin Yao, Sebastian Riedel, Andrew ...
CONCUR
1992
Springer
13 years 12 months ago
The Duality of TIme and Information
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
Vaughan R. Pratt
SG
2009
Springer
14 years 2 months ago
Towards the Big Picture: Enriching 3D Models with Information Visualisation and Vice Versa
Abstract. Most information visualisation methods are based on abstract visual representations without any concrete manifestation in the “real world”. However, a variety of abst...
Michael Sedlmair, Kerstin Ruhland, Fabian Hennecke...
GIS
2007
ACM
14 years 8 months ago
A model for enriching trajectories with semantic geographical information
The collection of moving object data is becoming more and more common, and therefore there is an increasing need for the efficient analysis and knowledge extraction of these data ...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...