26354 search results - page 291 / 5271 » How we refactor, and how we know it |
158
click to vote
CHI
2010
ACM
15 years 11 months ago
2010
ACM
A group of friends visiting a crowded and noisy music festival is an example of a situation where knowing the location of other people is important, but where external factors, su...
184
click to vote
ISTCS
1997
Springer
15 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
187
click to vote
CLEF
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2007. This year we are using forms of the Entry Vocabulary Indexes and Thesaurus...
194
click to vote
CAMAD
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we show results from a packet-level traffic characterization aiming at finding spatial and temporal invariances of TCP based applications, such as HTTP and SMTP. We d...
168
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...