Sciweavers

2745 search results - page 284 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
VIS
2007
IEEE
235views Visualization» more  VIS 2007»
16 years 6 months ago
Efficient Surface Reconstruction using Generalized Coulomb Potentials
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
Andrei C. Jalba, Jos B. T. M. Roerdink
152
Voted
BMCBI
2006
136views more  BMCBI 2006»
15 years 5 months ago
EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
Background: Understanding gene regulatory networks has become one of the central research problems in bioinformatics. More than thirty algorithms have been proposed to identify DN...
Jianjun Hu, Yifeng D. Yang, Daisuke Kihara
JMLR
2008
230views more  JMLR 2008»
15 years 4 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
127
Voted
COMAD
2008
15 years 6 months ago
The Efficient Maintenance of Access Roles with Role Hiding
Role-based access control (RBAC) has attracted considerable research interest. However, the computational issues of RBAC models are yet to be thoroughly studied. In this paper, we...
Chaoyi Pang, Xiuzhen Zhang, Yanchun Zhang, Kotagir...
ICML
2003
IEEE
16 years 5 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington