Sciweavers

7259 search results - page 1424 / 1452
» From Fields to Trees
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICAIL
2005
ACM
14 years 1 months ago
A study of accrual of arguments, with applications to evidential reasoning
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
Henry Prakken
SPAA
2005
ACM
14 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
14 years 1 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
APWEB
2005
Springer
14 years 1 months ago
Indexing Text and Visual Features for WWW Images
In this paper, we present a novel indexing technique called Multi-scale Similarity Indexing (MSI) to index image’s multi-features into a single one-dimensional structure. Both f...
Heng Tao Shen, Xiaofang Zhou, Bin Cui
« Prev « First page 1424 / 1452 Last » Next »