Sciweavers

23 search results - page 1 / 5
» Compact and efficient strings for Java
Sort
View
SCP
2010
163views more  SCP 2010»
12 years 11 months ago
Compact and efficient strings for Java
In several Java VMs, strings consist of two separate objects: metadata such as the string length are stored in the actual string object, while the string characters are stored in ...
Christian Häubl, Christian Wimmer, Hanspeter ...
VLDB
2008
ACM
136views Database» more  VLDB 2008»
14 years 5 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 9 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
EDBT
2008
ACM
178views Database» more  EDBT 2008»
14 years 5 months ago
Compacting music signatures for efficient music retrieval
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
Bin Cui, H. V. Jagadish, Beng Chin Ooi, Kian-Lee T...
ICSE
2004
IEEE-ACM
14 years 5 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury