Sciweavers

3481 search results - page 589 / 697
» A New Approach to Component Testing
Sort
View
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 6 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
OSDI
2008
ACM
16 years 6 months ago
Binary Translation Using Peephole Superoptimizers
We present a new scheme for performing binary translation that produces code comparable to or better than existing binary translators with much less engineering effort. Instead of...
Sorav Bansal, Alex Aiken
ICFP
2001
ACM
16 years 6 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
ICWS
2009
IEEE
16 years 3 months ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
16 years 24 days ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis