Sciweavers

1897 search results - page 147 / 380
» Sparse Additive Machine
Sort
View
FTDCS
2004
IEEE
15 years 4 months ago
The vMatrix: Server Switching
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
Amr Awadallah, Mendel Rosenblum
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 1 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
FPGA
2006
ACM
90views FPGA» more  FPGA 2006»
15 years 4 months ago
Improving performance and robustness of domain-specific CPLDs
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...
Mark Holland, Scott Hauck
85
Voted
ICPR
2006
IEEE
16 years 1 months ago
Fundamental Matrix Estimation via TIP - Transfer of Invariant Parameters
The fundamental matrix (FM) represents the perspective transform between two or more uncalibrated images of a stationary scene, and is traditionally estimated based on 2parameter ...
Frank Riggi, Matthew Toews, Tal Arbel
114
Voted
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
15 years 10 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...