Sciweavers

7167 search results - page 1297 / 1434
» A Technique for Invariant Generation
Sort
View
TCAD
1998
114views more  TCAD 1998»
14 years 9 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
TOSEM
1998
80views more  TOSEM 1998»
14 years 9 months ago
Discovering Models of Software Processes from Event-Based Data
Many software process methods and tools presuppose the existence of a formal model of a process. Unfortunately, developing a formal model for an on-going, complex process can be d...
Jonathan E. Cook, Alexander L. Wolf
CGF
2008
151views more  CGF 2008»
14 years 9 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
CIKM
2010
Springer
14 years 8 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
« Prev « First page 1297 / 1434 Last » Next »