Sciweavers

493 search results - page 5 / 99
» Representing preferences using intervals
Sort
View
ANSS
1998
IEEE
13 years 12 months ago
On Interval Weighted Three-Layer Neural Networks
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
Mohsen Beheshti, Ali Berrached, André de Ko...
SIGDIAL
2010
13 years 5 months ago
Representing Uncertainty about Complex User Goals in Statistical Dialogue Systems
We point out several problems in scalingup statistical approaches to spoken dialogue systems to enable them to deal with complex but natural user goals, such as disjunctive and ne...
Paul A. Crook, Oliver Lemon
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 7 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
PVLDB
2010
158views more  PVLDB 2010»
13 years 6 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara