Sciweavers

11328 search results - page 1973 / 2266
» Timed Branching Processes
Sort
View
159
Voted
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
16 years 4 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ICSE
2005
IEEE-ACM
16 years 4 months ago
Use of relative code churn measures to predict system defect density
Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to...
Nachiappan Nagappan, Thomas Ball
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
16 years 1 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
SOSP
2009
ACM
16 years 1 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
« Prev « First page 1973 / 2266 Last » Next »