Sciweavers

14424 search results - page 2857 / 2885
» Modeling Radio Networks
Sort
View
119
Voted
CIKM
2008
Springer
15 years 4 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan
156
Voted
ACCV
2006
Springer
15 years 4 months ago
Learning Multi-category Classification in Bayesian Framework
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
Atul Kanaujia, Dimitris N. Metaxas
135
Voted
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
15 years 4 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
DIM
2005
ACM
15 years 4 months ago
A delegation framework for federated identity management
Identity federation is a powerful scheme that links accounts of users maintained distinctly by different business partners. The concept of network identity is a driver for accele...
Hidehito Gomi, Makoto Hatakeyama, Shigeru Hosono, ...
152
Voted
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 4 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
« Prev « First page 2857 / 2885 Last » Next »