Sciweavers

7200 search results - page 1301 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 7 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
EUROSYS
2008
ACM
14 years 7 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
SAC
2010
ACM
14 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
EVOW
2010
Springer
14 years 4 months ago
Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions
DEODHAR, SUSHAMNA DEODHAR. Using Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions in Genetic Epidemiology. (Under the direction of Dr. Alison Motsinger-Re...
Sushamna Deodhar, Alison A. Motsinger-Reif
CVPR
2009
IEEE
14 years 4 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
« Prev « First page 1301 / 1440 Last » Next »