Sciweavers

474 search results - page 90 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 8 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
14 years 2 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
INFOCOM
2008
IEEE
14 years 2 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
ECCV
2006
Springer
14 years 9 months ago
Monocular Tracking of 3D Human Motion with a Coordinated Mixture of Factor Analyzers
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...
Rui Li, Ming-Hsuan Yang, Stan Sclaroff, Tai-Peng T...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 8 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...