Sciweavers

2446 search results - page 349 / 490
» Choiceless Polynomial Time
Sort
View
CCCG
2007
13 years 9 months ago
Approximate Shortest Descent Path on a Terrain
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
Sasanka Roy, Sachin Lodha, Sandip Das, Anil Mahesh...
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
13 years 9 months ago
Reconstructing Randomized Social Networks
In social networks, nodes correspond to entities and edges to links between them. In most of the cases, nodes are also associated with a set of features. Noise, missing values or ...
Niko Vuokko, Evimaria Terzi
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
IJCAI
2007
13 years 9 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
IJCAI
2007
13 years 9 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece