Sciweavers

522 search results - page 80 / 105
» The 3-Steiner Root Problem
Sort
View
ICS
2011
Tsinghua U.
13 years 3 days ago
Scalable fine-grained call path tracing
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
PLDI
2011
ACM
12 years 11 months ago
Caisson: a hardware description language for secure information flow
Information flow is an important security property that must be incorporated from the ground up, including at hardware design time, to provide a formal basis for a system’s roo...
Xun Li 0001, Mohit Tiwari, Jason Oberg, Vineeth Ka...
EDBT
2009
ACM
120views Database» more  EDBT 2009»
14 years 3 months ago
Retrieving meaningful relaxed tightest fragments for XML keyword search
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
Lingbo Kong, Rémi Gilleron, Aurélien...
CLUSTER
2007
IEEE
14 years 3 months ago
Anomaly localization in large-scale clusters
— A critical problem facing by managing large-scale clusters is to identify the location of problems in a system in case of unusual events. As the scale of high performance compu...
Ziming Zheng, Yawei Li, Zhiling Lan
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
14 years 2 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...