Sciweavers

3456 search results - page 78 / 692
» Byte Code Engineering
Sort
View
DCC
2010
IEEE
15 years 5 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
135
Voted
PEPM
2009
ACM
15 years 6 months ago
Clone detection and removal for Erlang/OTP within a refactoring environment
A well-known bad code smell in refactoring and software maintenance is duplicated code, or code clones. A code clone is a code fragment that is identical or similar to another. Un...
Huiqing Li, Simon Thompson
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
15 years 6 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
MOBICOM
2010
ACM
15 years 2 months ago
SMS-based web search for low-end mobile devices
Short Messaging Service (SMS) based mobile information services have become increasingly common around the world, especially in emerging regions among users with low-end mobile de...
Jay Chen, Lakshminarayanan Subramanian, Eric A. Br...
124
Voted
KBSE
2010
IEEE
15 years 22 days ago
Tag and prune: a pragmatic approach to software product line implementation
To realise variability at the code level, product line methods classically advocate usage of inheritance, components, frameworks, aspects or generative techniques. However, these ...
Quentin Boucher, Andreas Classen, Patrick Heymans,...