Sciweavers

2030 search results - page 142 / 406
» Extremal Problems of Information Combining
Sort
View
FC
2005
Springer
99views Cryptology» more  FC 2005»
15 years 10 months ago
Countering Identity Theft Through Digital Uniqueness, Location Cross-Checking, and Funneling
One of today’s fastest growing crimes is identity theft – the unauthorized use and exploitation of another individual’s identitycorroborating information. It is exacerbated b...
Paul C. van Oorschot, Stuart G. Stubblebine
FLAIRS
2004
15 years 6 months ago
Automatic Generation of Background Text to Aid Classification
We illustrate that Web searches can often be utilized to generate background text for use with text classification. This is the case because there are frequently many pages on the...
Sarah Zelikovitz, Robert Hafner
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 5 months ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright
171
Voted
ECAI
1990
Springer
15 years 9 months ago
Knowledge-Intensive Case-Based Reasoning and Sustained Learning
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
Agnar Aamodt
136
Voted
FSTTCS
2003
Springer
15 years 10 months ago
Pushdown Games with Unboundedness and Regular Conditions
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...