Sciweavers

2913 search results - page 167 / 583
» How Much to Copy
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 2 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
DLT
2007
14 years 7 days ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold
PROMISE
2010
13 years 5 months ago
Better, faster, and cheaper: what is better software?
Background: Defects are related to failures and they do not have much power for indicating a higher quality or a better system above the baseline that the end-users expect. Nevert...
Burak Turhan, Çetin Meriçli, Tekin M...
TIT
2010
111views Education» more  TIT 2010»
13 years 5 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
SIGSOFT
2008
ACM
14 years 11 months ago
Latent social structure in open source projects
Commercial software project managers design project organizational structure carefully, mindful of available skills, division of labour, geographical boundaries, etc. These organi...
Christian Bird, David S. Pattison, Raissa M. D'Sou...