Sciweavers

199 search results - page 30 / 40
» A Method for Selecting the Bin Size of a Time Histogram
Sort
View
DOCENG
2006
ACM
14 years 1 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
ECCV
2010
Springer
14 years 2 days ago
A Robust and Scalable Approach to Face Identification
The problem of face identification has received significant attention over the years. For a given probe face, the goal of face identification is to match this unknown face against ...
ISSRE
2006
IEEE
14 years 1 months ago
Detecting Redundant Unit Tests for AspectJ Programs
Aspect-oriented software development is gaining popularity with the adoption of languages such as AspectJ. Testing is an important part in any software development, including aspe...
Tao Xie, Jianjun Zhao, Darko Marinov, David Notkin
OPODIS
2004
13 years 9 months ago
Self-tuning Reactive Distributed Trees for Counting and Balancing
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
Phuong Hoai Ha, Marina Papatriantafilou, Philippas...
WWW
2004
ACM
14 years 8 months ago
Experiments with persian text compression for web
The increasing importance of Unicode for text encoding implies a possible doubling of data storage space and data transmission time, with a corresponding need for data compression...
Farhad Oroumchian, Ehsan Darrudi, Fattane Taghiyar...