Sciweavers

521 search results - page 47 / 105
» A Probabilistic Framework for Answer Selection in Question A...
Sort
View
ACL
2007
13 years 9 months ago
An Ensemble Method for Selection of High Quality Parses
While the average performance of statistical parsers gradually improves, they still attach to many sentences annotations of rather low quality. The number of such sentences grows ...
Roi Reichart, Ari Rappoport
ICCBSS
2004
Springer
14 years 1 months ago
Characterization of a Taxonomy for Business Applications and the Relationships Among Them
In this paper we propose a taxonomy for classifying COTS business applications, i.e. products that are used in the daily functioning of all types of organizations worldwide, such a...
Juan Pablo Carvallo, Xavier Franch, Carme Quer, Ma...
CJ
2002
67views more  CJ 2002»
13 years 7 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
PVLDB
2010
152views more  PVLDB 2010»
13 years 6 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
CICLING
2009
Springer
14 years 2 months ago
The Value of Weights in Automatically Generated Text Structures
Abstract. One question that arises if we want to evolve generation techniques to accommodate Web ontologies is how to capture and expose the relevant ontology content to the user. ...
Dana Dannélls