Results 251 to 260 of about 275,010 (282)
Some of the next articles are maybe not open access.
Proceedings of the 17th ACM conference on Information and knowledge management, 2008
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior of the users, as well as their implicit feedback to search engine results.
Paolo Boldi +5 more
openaire +2 more sources
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior of the users, as well as their implicit feedback to search engine results.
Paolo Boldi +5 more
openaire +2 more sources
The performance of flow graph locking
IEEE Transactions on Software Engineering, 1990The performance of flow graph locking (FGL) is compared with that of two-phase locking (2PL). As the data sharing level increases, FGL has a better response time than 2PL. Regardless of the data sharing or multiprogramming levels, FGL usually facilitates a better throughput rate than 2PL. >
Margaret H. Eich, Sharon M. Garard
openaire +1 more source
2009
This is a new applied development of trace theory to compilation. Trace theory allows to commute independent program instructions, but overlooks the differences between control and data dependencies. Control(C)-dependences, unlike data-dependences, are determined by the Control Flow Graph, modelled as a local DFA.
Simone Campanoni +1 more
openaire +2 more sources
This is a new applied development of trace theory to compilation. Trace theory allows to commute independent program instructions, but overlooks the differences between control and data dependencies. Control(C)-dependences, unlike data-dependences, are determined by the Control Flow Graph, modelled as a local DFA.
Simone Campanoni +1 more
openaire +2 more sources
Simplification of Signal Flow Graphs
Circuits, Systems, and Signal Processing, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
23rd ACM/IEEE Design Automation Conference, 1986
Alex Orailoglu, Daniel Gajski
openaire +1 more source
Alex Orailoglu, Daniel Gajski
openaire +1 more source
Mining for Paths in Flow Graphs
2010This paper presents FlowGSP, a data-mining algorithm that discovers frequent sequences of attributes in subpaths of a flow graph. FlowGSP was evaluated using flow graphs derived from the execution of transactions in the IBM® WebSphere® Application Server, a large real-world enterprise application server.
Adam Jocksch +2 more
openaire +1 more source
Antisymmetric flows on planar graphs
Journal of Graph Theory, 2006AbstractWe prove that every oriented planar graph admits a homomorphism to the Paley tournament P271 and hence that every oriented planar graph has an antisymmetric flow number and a strong oriented chromatic number of at most 271. © 2006 Wiley Periodicals, Inc.
openaire +1 more source
On multicommodity flows in planar graphs
Networks, 1984AbstractOkamura and Seymour recently proved two properties of multicommodity flows in undirected planar networks where all the sources and the sinks are on a common face of the underlying graph. One is that a feasible solution is guaranteed whenever each cut's capacity is at least as large as the cut's demand.
openaire +1 more source
Flows on metric graphs with general boundary conditions
Journal of Mathematical Analysis and Applications, 2022Klaus-Jochen Engel +1 more
exaly
Edge colorings and circular flows on regular graphs
Journal of Graph Theory, 2022Davide Mattiolo, Eckhard Steffen
exaly