Sciweavers

26354 search results - page 58 / 5271
» How we refactor, and how we know it
Sort
View
ACL
2012
11 years 11 months ago
Word Epoch Disambiguation: Finding How Words Change Over Time
In this paper we introduce the novel task of “word epoch disambiguation,” defined as the problem of identifying changes in word usage over time. Through experiments run using...
Rada Mihalcea, Vivi Nastase
ICCBR
2009
Springer
14 years 3 months ago
Case-Based Support for Forestry Decisions: How to See the Wood from the Trees
In forestry, it is important to be able to accurately determine the volume of timber in a harvesting site and the products that could potentially be produced from that timber. We d...
Conor Nugent, Derek G. Bridge, Glen Murphy, Bernt-...
GLOBECOM
2007
IEEE
14 years 3 months ago
Cognitive Radio Networks: How Much Spectrum Sharing is Optimal?
Abstract—We explore the performance tradeoff between opportunistic and regulated access inherent in the design of multiuser cognitive radio networks. We consider a cognitive radi...
Sudhir Srinivasa, Syed Ali Jafar
VTS
2002
IEEE
106views Hardware» more  VTS 2002»
14 years 1 months ago
How Effective are Compression Codes for Reducing Test Data Volume?
Run-length codes and their variants have recently been shown to be very effective for compressing system-on-achip (SOC) test data. In this paper, we analyze the Golomb code, the c...
Anshuman Chandra, Krishnendu Chakrabarty, Rafael A...
LICS
1997
IEEE
14 years 17 days ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...