Sciweavers

3134 search results - page 526 / 627
» Computing full disjunctions
Sort
View
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 10 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 10 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
VLSID
2002
IEEE
78views VLSI» more  VLSID 2002»
14 years 10 months ago
Optimization of Test Accesses with a Combined BIST and External Test Scheme
External pins for test are precious hardware resources because this number is strongly restricted. Cores are tested via test access mechanisms (TAMs) such as a test bus architectu...
Makoto Sugihara, Hiroto Yasuura
POPL
2003
ACM
14 years 10 months ago
Interprocedural compatibility analysis for static object preallocation
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...
POPL
2003
ACM
14 years 10 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta