Sciweavers

616 search results - page 21 / 124
» Decoding One Out of Many
Sort
View
CCA
2005
Springer
13 years 10 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
IADIS
2003
13 years 9 months ago
E-Democracy: Internet Voting
Voting via the Internet is part of electronic government and electronic democracy. However, there are many obstacles which have to be overcome, especially legal restrictions have ...
Guido Schryen
ATMOS
2009
130views Optimization» more  ATMOS 2009»
13 years 9 months ago
Arc-Flags in Dynamic Graphs
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...
DEBU
2008
156views more  DEBU 2008»
13 years 8 months ago
Towards Automatic Test Database Generation
Testing is one of the most expensive and time consuming activities in the software development cycle. In order to reduce the cost and the time to market, many approaches to automa...
Carsten Binnig, Donald Kossmann, Eric Lo
EACL
1993
ACL Anthology
13 years 9 months ago
A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
Josée S. Heemskerk