Sciweavers

2197 search results - page 255 / 440
» Sampling community structure
Sort
View
PLDI
2011
ACM
14 years 6 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in ā€œregularā€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
137
Voted
CVPR
2003
IEEE
16 years 6 months ago
Object Removal by Exemplar-Based Inpainting
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
Antonio Criminisi, Kentaro Toyama, Patrick P&eacut...
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
15 years 10 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
158
Voted
JMLR
2008
168views more  JMLR 2008»
15 years 3 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
TCBB
2008
107views more  TCBB 2008»
15 years 3 months ago
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
Hyuk Cho, Inderjit S. Dhillon